./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-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-11.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 ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:09:07,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:09:08,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:09:08,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:09:08,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:09:08,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:09:08,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:09:08,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:09:08,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:09:08,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:09:08,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:09:08,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:09:08,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:09:08,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:09:08,089 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:09:08,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:09:08,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:09:08,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:09:08,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:09:08,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:09:08,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:09:08,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:09:08,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:09:08,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:09:08,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:09:08,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:09:08,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:09:08,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:09:08,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:09:08,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:09:08,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:09:08,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:09:08,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:09:08,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:09:08,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:09:08,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:09:08,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:09:08,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:09:08,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:09:08,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:09:08,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:09:08,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:09:08,102 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 -> ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 [2024-10-13 00:09:08,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:09:08,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:09:08,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:09:08,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:09:08,418 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:09:08,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-10-13 00:09:10,007 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:09:10,238 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:09:10,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-10-13 00:09:10,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c245e628/583f85641d51461cb3edec65801358d9/FLAGc556c1fcb [2024-10-13 00:09:10,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c245e628/583f85641d51461cb3edec65801358d9 [2024-10-13 00:09:10,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:09:10,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:09:10,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:09:10,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:09:10,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:09:10,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec27d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10, skipping insertion in model container [2024-10-13 00:09:10,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:09:10,495 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-11.i[917,930] [2024-10-13 00:09:10,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:09:10,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:09:10,578 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-11.i[917,930] [2024-10-13 00:09:10,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:09:10,622 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:09:10,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10 WrapperNode [2024-10-13 00:09:10,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:09:10,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:09:10,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:09:10,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:09:10,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,670 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-13 00:09:10,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:09:10,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:09:10,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:09:10,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:09:10,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,705 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-13 00:09:10,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:09:10,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:09:10,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:09:10,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:09:10,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (1/1) ... [2024-10-13 00:09:10,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:09:10,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:09:10,763 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-13 00:09:10,768 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-13 00:09:10,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:09:10,809 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:09:10,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:09:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:09:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:09:10,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:09:10,883 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:09:10,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:09:11,186 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:09:11,187 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:09:11,250 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:09:11,253 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:09:11,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:11 BoogieIcfgContainer [2024-10-13 00:09:11,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:09:11,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:09:11,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:09:11,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:09:11,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:09:10" (1/3) ... [2024-10-13 00:09:11,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d6b21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:11, skipping insertion in model container [2024-10-13 00:09:11,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:10" (2/3) ... [2024-10-13 00:09:11,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d6b21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:11, skipping insertion in model container [2024-10-13 00:09:11,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:11" (3/3) ... [2024-10-13 00:09:11,270 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-11.i [2024-10-13 00:09:11,289 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:09:11,290 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:09:11,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:09:11,405 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;@745cedba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:09:11,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:09:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:09:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 00:09:11,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:09:11,422 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:09:11,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:09:11,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:09:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2007679347, now seen corresponding path program 1 times [2024-10-13 00:09:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:09:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516308742] [2024-10-13 00:09:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:09:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:09:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:09:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:09:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:09:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:09:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:09:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:09:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:09:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:09:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:09:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:09:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:09:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:09:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:09:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:09:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:09:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:09:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:09:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:09:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:09:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:09:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:09:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:09:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 00:09:11,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:09:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516308742] [2024-10-13 00:09:11,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516308742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:09:11,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:09:11,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:09:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485270371] [2024-10-13 00:09:11,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:09:11,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:09:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:09:11,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:09:11,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:09:11,998 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 00:09:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:09:12,045 INFO L93 Difference]: Finished difference Result 119 states and 213 transitions. [2024-10-13 00:09:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:09:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2024-10-13 00:09:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:09:12,064 INFO L225 Difference]: With dead ends: 119 [2024-10-13 00:09:12,064 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 00:09:12,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:09:12,077 INFO L432 NwaCegarLoop]: 88 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, 88 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-13 00:09:12,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:09:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 00:09:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 00:09:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:09:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-13 00:09:12,126 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 140 [2024-10-13 00:09:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:09:12,126 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-13 00:09:12,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 00:09:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-13 00:09:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 00:09:12,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:09:12,132 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:09:12,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:09:12,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:09:12,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:09:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash 394913735, now seen corresponding path program 1 times [2024-10-13 00:09:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:09:12,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720357685] [2024-10-13 00:09:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:12,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:09:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:09:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:09:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:09:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:09:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:09:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:09:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:09:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:09:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:09:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:09:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:09:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:09:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:09:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:09:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:09:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:09:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:09:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:09:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:09:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:09:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:09:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:09:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:09:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 66 proven. 60 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-10-13 00:09:13,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:09:13,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720357685] [2024-10-13 00:09:13,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720357685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:09:13,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678571293] [2024-10-13 00:09:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:13,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:09:13,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:09:13,735 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-13 00:09:13,738 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-13 00:09:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:14,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 00:09:14,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:09:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 740 proven. 108 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-13 00:09:16,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:09:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678571293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:09:17,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:09:17,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 25 [2024-10-13 00:09:17,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509628688] [2024-10-13 00:09:17,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:09:17,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 00:09:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:09:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 00:09:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 00:09:17,640 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 10 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (42), 9 states have call predecessors, (42), 10 states have call successors, (42) [2024-10-13 00:09:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:09:18,824 INFO L93 Difference]: Finished difference Result 167 states and 241 transitions. [2024-10-13 00:09:18,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 00:09:18,827 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 10 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (42), 9 states have call predecessors, (42), 10 states have call successors, (42) Word has length 140 [2024-10-13 00:09:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:09:18,829 INFO L225 Difference]: With dead ends: 167 [2024-10-13 00:09:18,829 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 00:09:18,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=684, Invalid=1968, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 00:09:18,834 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 280 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 00:09:18,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 416 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 00:09:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 00:09:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2024-10-13 00:09:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.303030303030303) internal successors, (86), 67 states have internal predecessors, (86), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 00:09:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-10-13 00:09:18,868 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 140 [2024-10-13 00:09:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:09:18,869 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-10-13 00:09:18,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 10 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (42), 9 states have call predecessors, (42), 10 states have call successors, (42) [2024-10-13 00:09:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-10-13 00:09:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 00:09:18,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:09:18,872 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:09:18,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 00:09:19,073 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-13 00:09:19,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:09:19,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:09:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1886725, now seen corresponding path program 1 times [2024-10-13 00:09:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:09:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638977040] [2024-10-13 00:09:19,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:09:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:09:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:09:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:09:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:09:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:09:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:09:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:09:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:09:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:09:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:09:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:09:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:09:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:09:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:09:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:09:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:09:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:09:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:09:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:09:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:09:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:09:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:09:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:09:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 66 proven. 60 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-10-13 00:09:19,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:09:19,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638977040] [2024-10-13 00:09:19,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638977040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:09:19,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910010879] [2024-10-13 00:09:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:19,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:09:19,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:09:19,754 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-13 00:09:19,756 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-13 00:09:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:20,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 00:09:20,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:09:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 713 proven. 162 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-13 00:09:21,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:09:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910010879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:09:22,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:09:22,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20] total 26 [2024-10-13 00:09:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270263217] [2024-10-13 00:09:22,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:09:22,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 00:09:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:09:22,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 00:09:22,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 00:09:22,856 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 26 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 12 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (43), 11 states have call predecessors, (43), 12 states have call successors, (43) [2024-10-13 00:09:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:09:23,497 INFO L93 Difference]: Finished difference Result 207 states and 291 transitions. [2024-10-13 00:09:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 00:09:23,499 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 12 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (43), 11 states have call predecessors, (43), 12 states have call successors, (43) Word has length 140 [2024-10-13 00:09:23,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:09:23,502 INFO L225 Difference]: With dead ends: 207 [2024-10-13 00:09:23,503 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 00:09:23,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=610, Invalid=1742, Unknown=0, NotChecked=0, Total=2352 [2024-10-13 00:09:23,506 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 160 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:09:23,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 216 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 00:09:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 00:09:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-10-13 00:09:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 00:09:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-10-13 00:09:23,531 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 140 [2024-10-13 00:09:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:09:23,532 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-10-13 00:09:23,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 12 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (43), 11 states have call predecessors, (43), 12 states have call successors, (43) [2024-10-13 00:09:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-10-13 00:09:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 00:09:23,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:09:23,535 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:09:23,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:09:23,739 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-13 00:09:23,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:09:23,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:09:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1428001942, now seen corresponding path program 1 times [2024-10-13 00:09:23,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:09:23,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710371141] [2024-10-13 00:09:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:09:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:09:23,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:09:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:09:23,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:09:23,996 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:09:23,997 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:09:23,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:09:24,002 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 00:09:24,101 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:09:24,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:09:24 BoogieIcfgContainer [2024-10-13 00:09:24,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:09:24,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:09:24,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:09:24,106 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:09:24,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:11" (3/4) ... [2024-10-13 00:09:24,110 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:09:24,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:09:24,114 INFO L158 Benchmark]: Toolchain (without parser) took 13843.45ms. Allocated memory was 167.8MB in the beginning and 281.0MB in the end (delta: 113.2MB). Free memory was 112.0MB in the beginning and 234.9MB in the end (delta: -122.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:09:24,114 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:09:24,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.73ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 96.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 00:09:24,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.03ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:09:24,116 INFO L158 Benchmark]: Boogie Preprocessor took 53.68ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 91.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:09:24,116 INFO L158 Benchmark]: RCFGBuilder took 529.02ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 69.1MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 00:09:24,116 INFO L158 Benchmark]: TraceAbstraction took 12846.91ms. Allocated memory was 167.8MB in the beginning and 281.0MB in the end (delta: 113.2MB). Free memory was 68.6MB in the beginning and 236.0MB in the end (delta: -167.4MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. [2024-10-13 00:09:24,118 INFO L158 Benchmark]: Witness Printer took 5.66ms. Allocated memory is still 281.0MB. Free memory was 236.0MB in the beginning and 234.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:09:24,119 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.19ms. Allocated memory is still 167.8MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.73ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 96.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.03ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.68ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 91.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 529.02ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 69.1MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12846.91ms. Allocated memory was 167.8MB in the beginning and 281.0MB in the end (delta: 113.2MB). Free memory was 68.6MB in the beginning and 236.0MB in the end (delta: -167.4MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. * Witness Printer took 5.66ms. Allocated memory is still 281.0MB. Free memory was 236.0MB in the beginning and 234.9MB in the end (delta: 1.0MB). 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 someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someUnaryDOUBLEoperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 4; [L28] signed char var_1_7 = 0; [L29] signed char var_1_8 = 16; [L30] signed char var_1_9 = 4; [L31] unsigned long int var_1_10 = 128; [L32] unsigned long int var_1_11 = 1422462314; [L33] signed short int var_1_12 = 8; [L34] float var_1_13 = 49.5; [L35] float var_1_14 = 0.4; [L36] signed short int var_1_15 = -50; [L37] unsigned long int var_1_16 = 1; [L38] unsigned long int var_1_17 = 3609236770; [L39] unsigned long int var_1_18 = 2902762324; [L40] double var_1_19 = 3.8; [L41] double var_1_20 = 255.75; [L42] unsigned short int var_1_21 = 0; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L98] var_1_6 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L99] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L100] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L101] var_1_7 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L102] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L103] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L104] var_1_8 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L105] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L106] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L106] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=4] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L110] var_1_11 = __VERIFIER_nondet_ulong() [L111] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L111] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L112] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L113] var_1_13 = __VERIFIER_nondet_float() [L114] 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=128, var_1_11=2147483647, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L114] 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=128, var_1_11=2147483647, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L115] var_1_14 = __VERIFIER_nondet_float() [L116] 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=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L116] 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=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L117] var_1_17 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L118] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L119] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L120] var_1_18 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L121] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L122] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L123] var_1_20 = __VERIFIER_nondet_double() [L124] 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=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L124] 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=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L137] RET updateVariables() [L138] CALL step() [L46] var_1_1 = (var_1_2 || (! var_1_3)) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L47] COND TRUE var_1_5 == var_1_6 [L48] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L50] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L51] unsigned long int stepLocal_1 = var_1_10; [L52] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, stepLocal_0=9, stepLocal_1=1879543162, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L53] COND TRUE var_1_6 != stepLocal_1 VAL [isInitial=1, stepLocal_0=9, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L54] COND FALSE !(stepLocal_0 <= var_1_6) VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L62] COND FALSE !(\read(var_1_2)) [L71] var_1_15 = 5 VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L73] COND TRUE var_1_13 != var_1_14 [L74] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L82] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) [L83] unsigned char stepLocal_2 = var_1_12 == (var_1_8 - var_1_9); VAL [isInitial=1, stepLocal_2=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L84] COND FALSE !(stepLocal_2 && var_1_2) VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L138] RET step() [L139] CALL, EXPR property() [L129-L130] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_5 == var_1_6) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((var_1_6 != var_1_10) ? ((var_1_8 <= var_1_6) ? (((- var_1_13) >= var_1_14) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_2 ? ((var_1_13 >= var_1_14) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_13 != var_1_14) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_5 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_12 == (var_1_8 - var_1_9)) && var_1_2) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=5, var_1_16=9, var_1_17=-2, var_1_18=-2147483649, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=9, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 454 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 720 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 966 IncrementalHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 206 mSDtfsCounter, 966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=2, InterpolantAutomatonStates: 44, 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, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 6119 SizeOfPredicates, 10 NumberOfNonLiveVariables, 647 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4670/5060 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-13 00:09:24,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-11.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 ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:09:26,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:09:26,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:09:26,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:09:26,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:09:26,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:09:26,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:09:26,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:09:26,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:09:26,681 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:09:26,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:09:26,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:09:26,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:09:26,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:09:26,687 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:09:26,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:09:26,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:09:26,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:09:26,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:09:26,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:09:26,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:09:26,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:09:26,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:09:26,691 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:09:26,692 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:09:26,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:09:26,692 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:09:26,692 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:09:26,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:09:26,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:09:26,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:09:26,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:09:26,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:09:26,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:09:26,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:09:26,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:09:26,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:09:26,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:09:26,695 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:09:26,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:09:26,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:09:26,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:09:26,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:09:26,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:09:26,698 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:09:26,698 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 -> ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 [2024-10-13 00:09:27,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:09:27,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:09:27,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:09:27,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:09:27,078 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:09:27,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-10-13 00:09:28,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:09:29,028 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:09:29,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-10-13 00:09:29,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec4b7f8d/bed969e47d9a41fd85256e4f6a4cc8e8/FLAG7430d22d7 [2024-10-13 00:09:29,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec4b7f8d/bed969e47d9a41fd85256e4f6a4cc8e8 [2024-10-13 00:09:29,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:09:29,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:09:29,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:09:29,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:09:29,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:09:29,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2104f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29, skipping insertion in model container [2024-10-13 00:09:29,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:09:29,331 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-11.i[917,930] [2024-10-13 00:09:29,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:09:29,416 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:09:29,432 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-11.i[917,930] [2024-10-13 00:09:29,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:09:29,486 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:09:29,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29 WrapperNode [2024-10-13 00:09:29,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:09:29,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:09:29,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:09:29,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:09:29,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,546 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-13 00:09:29,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:09:29,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:09:29,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:09:29,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:09:29,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,580 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-13 00:09:29,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:09:29,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:09:29,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:09:29,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:09:29,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (1/1) ... [2024-10-13 00:09:29,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:09:29,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:09:29,670 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-13 00:09:29,674 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-13 00:09:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:09:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:09:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:09:29,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:09:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:09:29,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:09:29,810 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:09:29,814 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:09:30,238 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:09:30,238 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:09:30,343 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:09:30,343 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:09:30,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:30 BoogieIcfgContainer [2024-10-13 00:09:30,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:09:30,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:09:30,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:09:30,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:09:30,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:09:29" (1/3) ... [2024-10-13 00:09:30,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385da834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:30, skipping insertion in model container [2024-10-13 00:09:30,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29" (2/3) ... [2024-10-13 00:09:30,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385da834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:30, skipping insertion in model container [2024-10-13 00:09:30,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:30" (3/3) ... [2024-10-13 00:09:30,356 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-11.i [2024-10-13 00:09:30,373 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:09:30,374 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:09:30,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:09:30,460 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;@52460724, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:09:30,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:09:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:09:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 00:09:30,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:09:30,480 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:09:30,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:09:30,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:09:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2007679347, now seen corresponding path program 1 times [2024-10-13 00:09:30,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:09:30,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172748662] [2024-10-13 00:09:30,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:30,506 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-13 00:09:30,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:09:30,510 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-13 00:09:30,511 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-13 00:09:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:30,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:09:30,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:09:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-10-13 00:09:30,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:09:30,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:09:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172748662] [2024-10-13 00:09:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172748662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:09:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:09:30,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:09:30,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971283687] [2024-10-13 00:09:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:09:30,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:09:30,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:09:30,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:09:30,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:09:30,919 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 00:09:30,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:09:30,985 INFO L93 Difference]: Finished difference Result 119 states and 213 transitions. [2024-10-13 00:09:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:09:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2024-10-13 00:09:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:09:31,001 INFO L225 Difference]: With dead ends: 119 [2024-10-13 00:09:31,001 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 00:09:31,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-13 00:09:31,009 INFO L432 NwaCegarLoop]: 88 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, 88 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-13 00:09:31,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:09:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 00:09:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 00:09:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:09:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-13 00:09:31,069 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 140 [2024-10-13 00:09:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:09:31,070 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-13 00:09:31,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 00:09:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-13 00:09:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 00:09:31,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:09:31,077 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:09:31,087 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-13 00:09:31,281 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-13 00:09:31,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:09:31,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:09:31,284 INFO L85 PathProgramCache]: Analyzing trace with hash 394913735, now seen corresponding path program 1 times [2024-10-13 00:09:31,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:09:31,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973160811] [2024-10-13 00:09:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:09:31,285 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-13 00:09:31,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:09:31,287 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-13 00:09:31,309 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-13 00:09:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:09:31,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 00:09:31,520 INFO L278 TraceCheckSpWp]: Computing forward predicates...