./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:00:42,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:00:42,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:00:42,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:00:42,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:00:42,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:00:42,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:00:42,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:00:42,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:00:42,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:00:42,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:00:42,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:00:42,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:00:42,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:00:42,473 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:00:42,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:00:42,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:00:42,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:00:42,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:00:42,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:00:42,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:00:42,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:00:42,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:00:42,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:00:42,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:00:42,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:00:42,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:00:42,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:00:42,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:00:42,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:00:42,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:00:42,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:00:42,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:00:42,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:00:42,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:00:42,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:00:42,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:00:42,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:00:42,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:00:42,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:00:42,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:00:42,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:00:42,487 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2024-11-16 18:00:42,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:00:42,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:00:42,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:00:42,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:00:42,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:00:42,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-16 18:00:44,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:00:44,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:00:44,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-16 18:00:44,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2d274b4/c9815751a1b948c9a3cf36e61c230187/FLAG1ee1f6670 [2024-11-16 18:00:44,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2d274b4/c9815751a1b948c9a3cf36e61c230187 [2024-11-16 18:00:44,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:00:44,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:00:44,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:00:44,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:00:44,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:00:44,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:00:44" (1/1) ... [2024-11-16 18:00:44,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65983dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:44, skipping insertion in model container [2024-11-16 18:00:44,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:00:44" (1/1) ... [2024-11-16 18:00:44,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:00:45,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-11-16 18:00:45,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:00:45,143 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:00:45,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-11-16 18:00:45,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:00:45,205 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:00:45,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45 WrapperNode [2024-11-16 18:00:45,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:00:45,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:00:45,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:00:45,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:00:45,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,254 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-16 18:00:45,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:00:45,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:00:45,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:00:45,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:00:45,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,282 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 18:00:45,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:00:45,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:00:45,295 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:00:45,295 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:00:45,296 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (1/1) ... [2024-11-16 18:00:45,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:00:45,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:00:45,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:00:45,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:00:45,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:00:45,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:00:45,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:00:45,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:00:45,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:00:45,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:00:45,483 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:00:45,486 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:00:45,758 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 18:00:45,759 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:00:45,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:00:45,778 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:00:45,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:00:45 BoogieIcfgContainer [2024-11-16 18:00:45,779 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:00:45,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:00:45,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:00:45,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:00:45,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:00:44" (1/3) ... [2024-11-16 18:00:45,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4259a59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:00:45, skipping insertion in model container [2024-11-16 18:00:45,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:45" (2/3) ... [2024-11-16 18:00:45,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4259a59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:00:45, skipping insertion in model container [2024-11-16 18:00:45,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:00:45" (3/3) ... [2024-11-16 18:00:45,796 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2024-11-16 18:00:45,813 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:00:45,813 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:00:45,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:00:45,887 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a54b95f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:00:45,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:00:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 18:00:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:00:45,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:00:45,908 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:00:45,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:00:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:00:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1521006694, now seen corresponding path program 1 times [2024-11-16 18:00:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:00:45,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813388390] [2024-11-16 18:00:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:00:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:00:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:00:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:00:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:00:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:00:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:00:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 18:00:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:00:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:00:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 18:00:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 18:00:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 18:00:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 18:00:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:00:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:00:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 18:00:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 18:00:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 18:00:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 18:00:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 18:00:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 18:00:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 18:00:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 18:00:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 18:00:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 18:00:46,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:00:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813388390] [2024-11-16 18:00:46,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813388390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:00:46,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:00:46,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:00:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272600190] [2024-11-16 18:00:46,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:00:46,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:00:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:00:46,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:00:46,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:00:46,419 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 18:00:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:00:46,448 INFO L93 Difference]: Finished difference Result 120 states and 206 transitions. [2024-11-16 18:00:46,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:00:46,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-16 18:00:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:00:46,461 INFO L225 Difference]: With dead ends: 120 [2024-11-16 18:00:46,461 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 18:00:46,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:00:46,470 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:00:46,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:00:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 18:00:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-16 18:00:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 18:00:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-16 18:00:46,519 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 143 [2024-11-16 18:00:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:00:46,520 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-16 18:00:46,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 18:00:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-16 18:00:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:00:46,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:00:46,530 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:00:46,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:00:46,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:00:46,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:00:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash -337591865, now seen corresponding path program 1 times [2024-11-16 18:00:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:00:46,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136293510] [2024-11-16 18:00:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:00:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:00:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:00:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:00:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:00:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:00:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:00:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 18:00:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:00:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:00:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 18:00:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 18:00:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 18:00:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 18:00:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:00:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:00:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 18:00:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 18:00:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 18:00:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 18:00:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 18:00:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 18:00:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 18:00:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 18:00:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 18:00:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:00:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 18:00:48,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:00:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136293510] [2024-11-16 18:00:48,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136293510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:00:48,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:00:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:00:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148730849] [2024-11-16 18:00:48,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:00:48,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:00:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:00:48,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:00:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:00:48,660 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 18:00:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:00:49,034 INFO L93 Difference]: Finished difference Result 148 states and 212 transitions. [2024-11-16 18:00:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:00:49,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-16 18:00:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:00:49,040 INFO L225 Difference]: With dead ends: 148 [2024-11-16 18:00:49,040 INFO L226 Difference]: Without dead ends: 92 [2024-11-16 18:00:49,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:00:49,043 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 126 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:00:49,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 298 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:00:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-16 18:00:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2024-11-16 18:00:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 18:00:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2024-11-16 18:00:49,065 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 143 [2024-11-16 18:00:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:00:49,067 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2024-11-16 18:00:49,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 18:00:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2024-11-16 18:00:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:00:49,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:00:49,070 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:00:49,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:00:49,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:00:49,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:00:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2145046328, now seen corresponding path program 1 times [2024-11-16 18:00:49,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:00:49,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965226730] [2024-11-16 18:00:49,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:00:49,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:00:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:00:49,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:00:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:00:49,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:00:49,266 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:00:49,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:00:49,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:00:49,271 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 18:00:49,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:00:49,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:00:49 BoogieIcfgContainer [2024-11-16 18:00:49,379 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:00:49,380 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:00:49,380 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:00:49,380 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:00:49,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:00:45" (3/4) ... [2024-11-16 18:00:49,383 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:00:49,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:00:49,385 INFO L158 Benchmark]: Toolchain (without parser) took 4533.10ms. Allocated memory was 186.6MB in the beginning and 247.5MB in the end (delta: 60.8MB). Free memory was 115.5MB in the beginning and 152.0MB in the end (delta: -36.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-11-16 18:00:49,387 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 186.6MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:00:49,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.81ms. Allocated memory is still 186.6MB. Free memory was 115.3MB in the beginning and 101.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 18:00:49,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.29ms. Allocated memory is still 186.6MB. Free memory was 101.0MB in the beginning and 98.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:00:49,388 INFO L158 Benchmark]: Boogie Preprocessor took 38.36ms. Allocated memory is still 186.6MB. Free memory was 98.5MB in the beginning and 95.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:00:49,388 INFO L158 Benchmark]: IcfgBuilder took 483.57ms. Allocated memory is still 186.6MB. Free memory was 95.8MB in the beginning and 155.0MB in the end (delta: -59.2MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-11-16 18:00:49,389 INFO L158 Benchmark]: TraceAbstraction took 3598.73ms. Allocated memory was 186.6MB in the beginning and 247.5MB in the end (delta: 60.8MB). Free memory was 153.6MB in the beginning and 153.1MB in the end (delta: 474.6kB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-16 18:00:49,389 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 247.5MB. Free memory was 153.1MB in the beginning and 152.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:00:49,393 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 186.6MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.81ms. Allocated memory is still 186.6MB. Free memory was 115.3MB in the beginning and 101.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.29ms. Allocated memory is still 186.6MB. Free memory was 101.0MB in the beginning and 98.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.36ms. Allocated memory is still 186.6MB. Free memory was 98.5MB in the beginning and 95.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 483.57ms. Allocated memory is still 186.6MB. Free memory was 95.8MB in the beginning and 155.0MB in the end (delta: -59.2MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3598.73ms. Allocated memory was 186.6MB in the beginning and 247.5MB in the end (delta: 60.8MB). Free memory was 153.6MB in the beginning and 153.1MB in the end (delta: 474.6kB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 247.5MB. Free memory was 153.1MB in the beginning and 152.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 16.6; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] double var_1_4 = 10.6; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_7 = 1; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 0; [L30] signed char var_1_10 = 10; [L31] unsigned char var_1_11 = 100; [L32] unsigned char var_1_12 = 64; [L33] unsigned char var_1_13 = 100; [L34] signed char var_1_14 = -4; [L35] signed char var_1_15 = 32; [L36] signed char var_1_16 = 4; [L37] signed char var_1_17 = 64; [L38] unsigned char last_1_var_1_5 = 0; VAL [isInitial=0, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=1, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=1, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L67] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L72] var_1_4 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L86] var_1_12 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L89] var_1_13 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] var_1_14 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L95] var_1_15 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L98] var_1_16 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L114] RET updateVariables() [L115] CALL step() [L42] COND FALSE !(\read(last_1_var_1_5)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L47] COND FALSE !(var_1_1 >= (- (var_1_4 * var_1_1))) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L50] COND TRUE var_1_3 || (256 >= (var_1_17 + 4)) [L51] var_1_5 = ((var_1_2 || var_1_3) || var_1_7) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L55] signed long int stepLocal_1 = (var_1_11 + var_1_12) - ((((var_1_13) < (1)) ? (var_1_13) : (1))); [L56] signed char stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_5=0, stepLocal_0=64, stepLocal_1=191, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L57] COND FALSE !(-10 >= stepLocal_0) VAL [isInitial=1, last_1_var_1_5=0, stepLocal_1=191, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((last_1_var_1_5 ? (last_1_var_1_5 ? (var_1_1 == ((double) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : 1) && ((var_1_3 || (256 >= (var_1_17 + 4))) ? (var_1_5 == ((unsigned char) ((var_1_2 || var_1_3) || var_1_7))) : (var_1_5 == ((unsigned char) (! (! (var_1_8 || var_1_9))))))) && ((-10 >= var_1_17) ? ((((var_1_11 + var_1_12) - ((((var_1_13) < (1)) ? (var_1_13) : (1)))) > (~ var_1_17)) ? (var_1_10 == ((signed char) (var_1_14 + var_1_15))) : (var_1_10 == ((signed char) var_1_16))) : 1)) && ((var_1_1 >= (- (var_1_4 * var_1_1))) ? (var_1_17 == ((signed char) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 385 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 219 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 166 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 26 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:00:49,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:00:51,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:00:51,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:00:51,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:00:51,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:00:51,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:00:51,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:00:51,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:00:51,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:00:51,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:00:51,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:00:51,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:00:51,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:00:51,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:00:51,730 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:00:51,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:00:51,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:00:51,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:00:51,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:00:51,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:00:51,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:00:51,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:00:51,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:00:51,736 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:00:51,738 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:00:51,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:00:51,738 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:00:51,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:00:51,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:00:51,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:00:51,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:00:51,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:00:51,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:00:51,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:00:51,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:00:51,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:00:51,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:00:51,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:00:51,742 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:00:51,742 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:00:51,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:00:51,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:00:51,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:00:51,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:00:51,743 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2024-11-16 18:00:52,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:00:52,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:00:52,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:00:52,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:00:52,106 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:00:52,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-16 18:00:53,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:00:53,951 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:00:53,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-16 18:00:53,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023963950/589bf46283cb488e95865533b3e1fe53/FLAG7c30d821b [2024-11-16 18:00:53,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023963950/589bf46283cb488e95865533b3e1fe53 [2024-11-16 18:00:53,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:00:53,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:00:53,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:00:53,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:00:53,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:00:53,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:00:53" (1/1) ... [2024-11-16 18:00:53,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6d8243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:53, skipping insertion in model container [2024-11-16 18:00:53,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:00:53" (1/1) ... [2024-11-16 18:00:54,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:00:54,221 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-11-16 18:00:54,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:00:54,308 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:00:54,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-11-16 18:00:54,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:00:54,375 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:00:54,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54 WrapperNode [2024-11-16 18:00:54,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:00:54,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:00:54,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:00:54,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:00:54,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,436 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-16 18:00:54,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:00:54,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:00:54,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:00:54,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:00:54,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,473 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 18:00:54,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,485 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:00:54,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:00:54,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:00:54,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:00:54,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (1/1) ... [2024-11-16 18:00:54,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:00:54,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:00:54,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:00:54,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:00:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:00:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:00:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:00:54,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:00:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:00:54,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:00:54,676 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:00:54,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:01:01,348 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 18:01:01,348 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:01:01,363 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:01:01,363 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:01:01,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:01 BoogieIcfgContainer [2024-11-16 18:01:01,364 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:01:01,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:01:01,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:01:01,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:01:01,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:00:53" (1/3) ... [2024-11-16 18:01:01,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ea8bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:01, skipping insertion in model container [2024-11-16 18:01:01,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:00:54" (2/3) ... [2024-11-16 18:01:01,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ea8bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:01, skipping insertion in model container [2024-11-16 18:01:01,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:01" (3/3) ... [2024-11-16 18:01:01,372 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2024-11-16 18:01:01,386 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:01:01,386 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:01:01,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:01:01,464 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7cc198f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:01:01,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:01:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 18:01:01,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:01:01,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:01,484 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:01:01,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:01,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1521006694, now seen corresponding path program 1 times [2024-11-16 18:01:01,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:01:01,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803316307] [2024-11-16 18:01:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:01,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:01:01,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:01:01,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:01:01,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 18:01:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:01,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:01:01,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:01:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-11-16 18:01:01,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:01:01,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:01:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803316307] [2024-11-16 18:01:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803316307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:01:01,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:01:01,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:01:01,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563639073] [2024-11-16 18:01:01,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:01:01,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:01:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:01:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:01:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:01:01,957 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 18:01:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:01:01,985 INFO L93 Difference]: Finished difference Result 120 states and 206 transitions. [2024-11-16 18:01:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:01:01,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-16 18:01:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:01:01,994 INFO L225 Difference]: With dead ends: 120 [2024-11-16 18:01:01,994 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 18:01:01,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:01:02,000 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:01:02,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:01:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 18:01:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-16 18:01:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 18:01:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-16 18:01:02,045 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 143 [2024-11-16 18:01:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:01:02,046 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-16 18:01:02,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 18:01:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-16 18:01:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:01:02,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:02,050 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:01:02,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 18:01:02,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:01:02,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:02,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash -337591865, now seen corresponding path program 1 times [2024-11-16 18:01:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:01:02,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828757700] [2024-11-16 18:01:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:02,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:01:02,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:01:02,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:01:02,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 18:01:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:02,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 18:01:02,576 INFO L278 TraceCheckSpWp]: Computing forward predicates...