./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.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 77fbc3ec0aa1e3a17f6dd73b5c59e0107945f53ef89e3fc3ca652830ca5bf043 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:31:44,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:31:44,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:31:44,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:31:44,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:31:44,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:31:44,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:31:44,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:31:44,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:31:44,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:31:44,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:31:44,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:31:44,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:31:44,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:31:44,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:31:44,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:31:44,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:31:44,593 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:31:44,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:31:44,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:31:44,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:31:44,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:31:44,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:31:44,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:31:44,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:31:44,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:31:44,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:31:44,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:31:44,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:31:44,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:31:44,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:31:44,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:31:44,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:31:44,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:31:44,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:31:44,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:31:44,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:31:44,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:31:44,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:31:44,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:31:44,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:31:44,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:31:44,601 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 -> 77fbc3ec0aa1e3a17f6dd73b5c59e0107945f53ef89e3fc3ca652830ca5bf043 [2024-10-24 05:31:44,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:31:44,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:31:44,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:31:44,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:31:44,858 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:31:44,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.i [2024-10-24 05:31:46,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:31:46,479 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:31:46,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.i [2024-10-24 05:31:46,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ea160b4/832af2e53963443295bd46df644eb6f8/FLAG360265159 [2024-10-24 05:31:46,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ea160b4/832af2e53963443295bd46df644eb6f8 [2024-10-24 05:31:46,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:31:46,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:31:46,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:31:46,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:31:46,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:31:46,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5f070c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46, skipping insertion in model container [2024-10-24 05:31:46,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:31:46,708 WARN L248 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_codestructure_steplocals_file-40.i[917,930] [2024-10-24 05:31:46,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:31:46,789 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:31:46,800 WARN L248 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_codestructure_steplocals_file-40.i[917,930] [2024-10-24 05:31:46,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:31:46,880 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:31:46,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46 WrapperNode [2024-10-24 05:31:46,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:31:46,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:31:46,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:31:46,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:31:46,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,925 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-10-24 05:31:46,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:31:46,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:31:46,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:31:46,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:31:46,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,962 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-10-24 05:31:46,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:46,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:31:46,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:31:46,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:31:46,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:31:46,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (1/1) ... [2024-10-24 05:31:47,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:31:47,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:31:47,032 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-10-24 05:31:47,035 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-10-24 05:31:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:31:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:31:47,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:31:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:31:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:31:47,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:31:47,143 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:31:47,145 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:31:47,406 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 05:31:47,406 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:31:47,464 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:31:47,465 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:31:47,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:31:47 BoogieIcfgContainer [2024-10-24 05:31:47,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:31:47,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:31:47,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:31:47,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:31:47,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:31:46" (1/3) ... [2024-10-24 05:31:47,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338bad7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:31:47, skipping insertion in model container [2024-10-24 05:31:47,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:46" (2/3) ... [2024-10-24 05:31:47,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338bad7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:31:47, skipping insertion in model container [2024-10-24 05:31:47,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:31:47" (3/3) ... [2024-10-24 05:31:47,474 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-40.i [2024-10-24 05:31:47,488 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:31:47,488 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:31:47,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:31:47,548 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;@16152c62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:31:47,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:31:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:31:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-24 05:31:47,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:31:47,566 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:31:47,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:31:47,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:31:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1400745751, now seen corresponding path program 1 times [2024-10-24 05:31:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:31:47,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699504671] [2024-10-24 05:31:47,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:31:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:31:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:31:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:31:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:31:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:31:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:31:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:31:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:31:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:31:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:31:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:31:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:31:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:47,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:31:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:31:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:31:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:31:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 05:31:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:31:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 05:31:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:31:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:31:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:31:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:31:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:31:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:31:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:31:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:31:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:31:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:31:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:31:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 05:31:48,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:31:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699504671] [2024-10-24 05:31:48,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699504671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:31:48,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:31:48,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:31:48,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761769687] [2024-10-24 05:31:48,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:31:48,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:31:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:31:48,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:31:48,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:31:48,118 INFO L87 Difference]: Start difference. First operand has 71 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 05:31:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:31:48,175 INFO L93 Difference]: Finished difference Result 139 states and 252 transitions. [2024-10-24 05:31:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:31:48,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 180 [2024-10-24 05:31:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:31:48,192 INFO L225 Difference]: With dead ends: 139 [2024-10-24 05:31:48,192 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 05:31:48,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-10-24 05:31:48,209 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:31:48,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:31:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 05:31:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-24 05:31:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:31:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2024-10-24 05:31:48,339 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 180 [2024-10-24 05:31:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:31:48,344 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2024-10-24 05:31:48,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 05:31:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2024-10-24 05:31:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 05:31:48,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:31:48,352 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:31:48,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:31:48,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:31:48,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:31:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 234128224, now seen corresponding path program 1 times [2024-10-24 05:31:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:31:48,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712762124] [2024-10-24 05:31:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:31:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:31:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:31:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:31:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:31:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:31:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:31:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:31:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:31:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:31:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:31:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:31:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:31:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:31:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:31:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:31:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:31:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 05:31:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:31:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 05:31:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:31:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:31:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:31:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:31:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:31:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:31:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:31:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:31:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:31:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:31:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:31:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:31:48,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:31:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712762124] [2024-10-24 05:31:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712762124] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:31:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023809219] [2024-10-24 05:31:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:48,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:31:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:31:48,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:31:48,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:31:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:49,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 05:31:49,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:31:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-10-24 05:31:49,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:31:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:31:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023809219] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:31:49,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:31:49,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 05:31:49,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291622648] [2024-10-24 05:31:49,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:31:49,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:31:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:31:49,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:31:49,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:31:49,641 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 05:31:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:31:49,855 INFO L93 Difference]: Finished difference Result 143 states and 212 transitions. [2024-10-24 05:31:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:31:49,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 181 [2024-10-24 05:31:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:31:49,858 INFO L225 Difference]: With dead ends: 143 [2024-10-24 05:31:49,858 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 05:31:49,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 418 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 05:31:49,859 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 60 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:31:49,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 123 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:31:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 05:31:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-10-24 05:31:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:31:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2024-10-24 05:31:49,880 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 181 [2024-10-24 05:31:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:31:49,880 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2024-10-24 05:31:49,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 05:31:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2024-10-24 05:31:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 05:31:49,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:31:49,882 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:31:49,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:31:50,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:31:50,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:31:50,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:31:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2009135586, now seen corresponding path program 1 times [2024-10-24 05:31:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:31:50,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73999061] [2024-10-24 05:31:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:31:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:31:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251625296] [2024-10-24 05:31:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:50,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:31:50,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:31:50,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:31:50,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 05:31:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:31:50,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:31:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:31:50,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:31:50,408 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:31:50,409 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:31:50,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 05:31:50,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 05:31:50,616 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 05:31:50,765 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:31:50,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:31:50 BoogieIcfgContainer [2024-10-24 05:31:50,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:31:50,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:31:50,772 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:31:50,772 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:31:50,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:31:47" (3/4) ... [2024-10-24 05:31:50,774 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:31:50,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:31:50,775 INFO L158 Benchmark]: Toolchain (without parser) took 4269.85ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 102.8MB in the beginning and 188.3MB in the end (delta: -85.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:31:50,775 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:31:50,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.35ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 102.8MB in the beginning and 202.9MB in the end (delta: -100.2MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-10-24 05:31:50,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.27ms. Allocated memory is still 232.8MB. Free memory was 202.9MB in the beginning and 198.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:31:50,776 INFO L158 Benchmark]: Boogie Preprocessor took 66.55ms. Allocated memory is still 232.8MB. Free memory was 198.7MB in the beginning and 191.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 05:31:50,777 INFO L158 Benchmark]: RCFGBuilder took 472.01ms. Allocated memory is still 232.8MB. Free memory was 191.4MB in the beginning and 163.1MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 05:31:50,777 INFO L158 Benchmark]: TraceAbstraction took 3304.60ms. Allocated memory is still 232.8MB. Free memory was 163.1MB in the beginning and 189.3MB in the end (delta: -26.3MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2024-10-24 05:31:50,777 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 232.8MB. Free memory is still 188.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:31:50,778 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.14ms. Allocated memory is still 176.2MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.35ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 102.8MB in the beginning and 202.9MB in the end (delta: -100.2MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.27ms. Allocated memory is still 232.8MB. Free memory was 202.9MB in the beginning and 198.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.55ms. Allocated memory is still 232.8MB. Free memory was 198.7MB in the beginning and 191.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 472.01ms. Allocated memory is still 232.8MB. Free memory was 191.4MB in the beginning and 163.1MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3304.60ms. Allocated memory is still 232.8MB. Free memory was 163.1MB in the beginning and 189.3MB in the end (delta: -26.3MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 232.8MB. Free memory is still 188.3MB. There was no memory consumed. 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 140, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someUnaryDOUBLEoperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = -100; [L25] signed short int var_1_4 = -200; [L26] signed long int var_1_5 = -2; [L27] unsigned short int var_1_6 = 32; [L28] unsigned short int var_1_7 = 8; [L29] unsigned short int var_1_8 = 5; [L30] unsigned char var_1_9 = 1; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] unsigned char var_1_12 = 16; [L34] double var_1_13 = 4.8; [L35] double var_1_14 = 8.4; [L36] unsigned char var_1_15 = 50; [L37] unsigned short int var_1_16 = 1; [L38] float var_1_17 = 25.4; [L39] signed long int var_1_19 = 2; [L40] float var_1_20 = 1.6; [L41] unsigned short int var_1_21 = 0; [L42] unsigned short int var_1_22 = 8; [L43] unsigned short int var_1_23 = 16; [L44] float var_1_24 = 128.5; [L45] double var_1_25 = -0.5; [L46] signed long int var_1_26 = 4; [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] FCALL updateLastVariables() [L148] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L91] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L92] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L93] var_1_3 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L94] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L95] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L96] var_1_4 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L97] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L98] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L99] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L100] var_1_5 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L101] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L102] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L102] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L103] var_1_6 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_7=8, var_1_8=5, var_1_9=1] [L104] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_7=8, var_1_8=5, var_1_9=1] [L105] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L105] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L106] var_1_7 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_8=5, var_1_9=1] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_8=5, var_1_9=1] [L108] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=5, var_1_9=1] [L108] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=5, var_1_9=1] [L109] var_1_8 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_9=1] [L110] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L111] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L112] var_1_10 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L113] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L114] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L115] var_1_11 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L116] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-255, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L117] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L117] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L118] var_1_13 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L119] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L120] var_1_14 = __VERIFIER_nondet_double() [L121] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L121] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L122] var_1_15 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L123] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L124] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L125] var_1_19 = __VERIFIER_nondet_long() [L126] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L126] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L127] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L127] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L128] var_1_20 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L129] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L130] var_1_22 = __VERIFIER_nondet_ushort() [L131] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L131] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L132] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L133] var_1_23 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L134] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L135] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L148] RET updateVariables() [L149] CALL step() [L50] signed long int stepLocal_0 = (var_1_3 * var_1_2) / var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L51] COND TRUE stepLocal_0 <= var_1_5 [L52] var_1_1 = var_1_6 VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L56] unsigned char stepLocal_1 = var_1_5 != var_1_4; VAL [isInitial=1, stepLocal_1=0, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L57] COND TRUE stepLocal_1 || var_1_10 [L58] var_1_9 = var_1_11 VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L60] COND FALSE !((var_1_9 && var_1_11) && (50 > var_1_8)) [L67] var_1_12 = var_1_15 VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L69] var_1_16 = (((((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) < (var_1_15)) ? ((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) : (var_1_15))) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L70] COND TRUE (var_1_1 - ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (var_1_8 - var_1_19) [L71] var_1_17 = var_1_20 VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L73] COND FALSE !((var_1_10 && var_1_11) && var_1_9) [L76] var_1_21 = ((23370 - var_1_15) + var_1_23) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L78] unsigned char stepLocal_2 = var_1_12; VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L79] COND FALSE !(! (-4 < var_1_22)) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L82] COND FALSE !(-4 > stepLocal_2) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L86] var_1_25 = var_1_20 [L87] var_1_26 = var_1_6 [L149] RET step() [L150] CALL, EXPR property() [L140-L141] return (((((((((((var_1_3 * var_1_2) / var_1_4) <= var_1_5) ? (var_1_1 == ((unsigned short int) var_1_6)) : (var_1_1 == ((unsigned short int) (var_1_7 + var_1_8)))) && (((var_1_5 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- var_1_13) < var_1_14) ? (var_1_10 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) < (var_1_15)) ? ((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) : (var_1_15)))))) && (((var_1_1 - ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (var_1_8 - var_1_19)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_10 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_12 + (var_1_15 + ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_23))))) && ((! (-4 < var_1_22)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_12) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_6)) ; [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-255, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=-1, var_1_3=1, var_1_4=2, var_1_5=2, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174 IncrementalHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 164 mSDtfsCounter, 174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 510 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 719 ConstructedInterpolants, 0 QuantifiedInterpolants, 1253 SizeOfPredicates, 1 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6861/6960 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-10-24 05:31:50,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.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 77fbc3ec0aa1e3a17f6dd73b5c59e0107945f53ef89e3fc3ca652830ca5bf043 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:31:53,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:31:53,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:31:53,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:31:53,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:31:53,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:31:53,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:31:53,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:31:53,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:31:53,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:31:53,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:31:53,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:31:53,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:31:53,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:31:53,287 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:31:53,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:31:53,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:31:53,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:31:53,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:31:53,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:31:53,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:31:53,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:31:53,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:31:53,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:31:53,293 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:31:53,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:31:53,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:31:53,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:31:53,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:31:53,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:31:53,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:31:53,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:31:53,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:31:53,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:31:53,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:31:53,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:31:53,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:31:53,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:31:53,297 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:31:53,297 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:31:53,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:31:53,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:31:53,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:31:53,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:31:53,298 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:31:53,298 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 -> 77fbc3ec0aa1e3a17f6dd73b5c59e0107945f53ef89e3fc3ca652830ca5bf043 [2024-10-24 05:31:53,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:31:53,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:31:53,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:31:53,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:31:53,660 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:31:53,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.i [2024-10-24 05:31:55,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:31:55,360 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:31:55,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-40.i [2024-10-24 05:31:55,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a4951c1/e44ebbe683a74aaeb4b2ab82b6c5f9ac/FLAG463d468b1 [2024-10-24 05:31:55,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a4951c1/e44ebbe683a74aaeb4b2ab82b6c5f9ac [2024-10-24 05:31:55,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:31:55,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:31:55,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:31:55,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:31:55,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:31:55,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522278af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55, skipping insertion in model container [2024-10-24 05:31:55,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:31:55,596 WARN L248 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_codestructure_steplocals_file-40.i[917,930] [2024-10-24 05:31:55,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:31:55,681 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:31:55,692 WARN L248 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_codestructure_steplocals_file-40.i[917,930] [2024-10-24 05:31:55,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:31:55,765 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:31:55,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55 WrapperNode [2024-10-24 05:31:55,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:31:55,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:31:55,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:31:55,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:31:55,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,817 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2024-10-24 05:31:55,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:31:55,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:31:55,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:31:55,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:31:55,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,857 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-10-24 05:31:55,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:31:55,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:31:55,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:31:55,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:31:55,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (1/1) ... [2024-10-24 05:31:55,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:31:55,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:31:55,914 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-10-24 05:31:55,918 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-10-24 05:31:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:31:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:31:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:31:55,969 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:31:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:31:55,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:31:56,039 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:31:56,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:31:56,524 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 05:31:56,524 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:31:56,595 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:31:56,596 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:31:56,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:31:56 BoogieIcfgContainer [2024-10-24 05:31:56,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:31:56,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:31:56,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:31:56,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:31:56,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:31:55" (1/3) ... [2024-10-24 05:31:56,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267a8aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:31:56, skipping insertion in model container [2024-10-24 05:31:56,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:55" (2/3) ... [2024-10-24 05:31:56,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267a8aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:31:56, skipping insertion in model container [2024-10-24 05:31:56,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:31:56" (3/3) ... [2024-10-24 05:31:56,606 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-40.i [2024-10-24 05:31:56,619 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:31:56,620 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:31:56,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:31:56,690 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;@219a353a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:31:56,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:31:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:31:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-24 05:31:56,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:31:56,708 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:31:56,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:31:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:31:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1400745751, now seen corresponding path program 1 times [2024-10-24 05:31:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:31:56,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468640612] [2024-10-24 05:31:56,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:56,726 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-10-24 05:31:56,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:31:56,730 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-10-24 05:31:56,732 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-10-24 05:31:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:57,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:31:57,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:31:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2024-10-24 05:31:57,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:31:57,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:31:57,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468640612] [2024-10-24 05:31:57,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468640612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:31:57,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:31:57,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:31:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571837803] [2024-10-24 05:31:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:31:57,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:31:57,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:31:57,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:31:57,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:31:57,112 INFO L87 Difference]: Start difference. First operand has 71 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 05:31:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:31:57,328 INFO L93 Difference]: Finished difference Result 139 states and 252 transitions. [2024-10-24 05:31:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:31:57,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 180 [2024-10-24 05:31:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:31:57,350 INFO L225 Difference]: With dead ends: 139 [2024-10-24 05:31:57,350 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 05:31:57,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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-10-24 05:31:57,360 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:31:57,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:31:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 05:31:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-24 05:31:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:31:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2024-10-24 05:31:57,425 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 180 [2024-10-24 05:31:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:31:57,443 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2024-10-24 05:31:57,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 05:31:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2024-10-24 05:31:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 05:31:57,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:31:57,449 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:31:57,459 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-10-24 05:31:57,650 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-10-24 05:31:57,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:31:57,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:31:57,651 INFO L85 PathProgramCache]: Analyzing trace with hash 234128224, now seen corresponding path program 1 times [2024-10-24 05:31:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:31:57,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433572047] [2024-10-24 05:31:57,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:57,652 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-10-24 05:31:57,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:31:57,654 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-10-24 05:31:57,654 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-10-24 05:31:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:57,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 05:31:57,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:31:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-10-24 05:31:58,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:31:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:31:58,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:31:58,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433572047] [2024-10-24 05:31:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433572047] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:31:58,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:31:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-24 05:31:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779691897] [2024-10-24 05:31:58,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:31:58,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:31:58,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:31:58,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:31:58,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:31:58,529 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 05:31:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:31:59,511 INFO L93 Difference]: Finished difference Result 217 states and 319 transitions. [2024-10-24 05:31:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 05:31:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 181 [2024-10-24 05:31:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:31:59,520 INFO L225 Difference]: With dead ends: 217 [2024-10-24 05:31:59,520 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 05:31:59,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-24 05:31:59,523 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 173 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 05:31:59,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 275 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 05:31:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 05:31:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 71. [2024-10-24 05:31:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:31:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2024-10-24 05:31:59,548 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 181 [2024-10-24 05:31:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:31:59,549 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2024-10-24 05:31:59,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 05:31:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2024-10-24 05:31:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 05:31:59,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:31:59,551 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:31:59,562 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-24 05:31:59,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-10-24 05:31:59,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:31:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:31:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2009135586, now seen corresponding path program 1 times [2024-10-24 05:31:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:31:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969391034] [2024-10-24 05:31:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:59,758 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-10-24 05:31:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:31:59,762 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-24 05:31:59,763 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 (4)] Waiting until timeout for monitored process [2024-10-24 05:32:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:32:00,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 05:32:00,197 INFO L278 TraceCheckSpWp]: Computing forward predicates...