./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-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.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 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:33:48,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:33:48,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:33:48,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:33:48,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:33:48,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:33:48,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:33:48,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:33:48,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:33:48,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:33:48,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:33:48,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:33:48,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:33:48,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:33:48,602 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:33:48,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:33:48,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:33:48,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:33:48,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:33:48,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:33:48,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:33:48,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:33:48,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:33:48,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:33:48,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:33:48,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:33:48,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:33:48,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:33:48,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:33:48,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:33:48,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:33:48,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:33:48,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:33:48,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:33:48,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:33:48,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:33:48,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:33:48,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:33:48,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:33:48,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:33:48,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:33:48,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:33:48,614 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 -> 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 [2024-10-24 05:33:48,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:33:48,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:33:48,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:33:48,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:33:48,916 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:33:48,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-10-24 05:33:50,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:33:50,557 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:33:50,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-10-24 05:33:50,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0413cb392/187fd52794394e2e973153a436098cb3/FLAGdec47fafa [2024-10-24 05:33:50,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0413cb392/187fd52794394e2e973153a436098cb3 [2024-10-24 05:33:50,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:33:50,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:33:50,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:33:50,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:33:50,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:33:50,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:50,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aad24d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50, skipping insertion in model container [2024-10-24 05:33:50,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:50,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:33:50,801 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-60.i[917,930] [2024-10-24 05:33:50,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:33:50,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:33:50,903 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-60.i[917,930] [2024-10-24 05:33:50,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:33:50,967 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:33:50,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50 WrapperNode [2024-10-24 05:33:50,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:33:50,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:33:50,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:33:50,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:33:50,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:50,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,020 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-24 05:33:51,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:33:51,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:33:51,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:33:51,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:33:51,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,055 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:33:51,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:33:51,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:33:51,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:33:51,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:33:51,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (1/1) ... [2024-10-24 05:33:51,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:33:51,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:33:51,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:33:51,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:33:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:33:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:33:51,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:33:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:33:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:33:51,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:33:51,351 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:33:51,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:33:51,635 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 05:33:51,636 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:33:51,680 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:33:51,680 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:33:51,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:33:51 BoogieIcfgContainer [2024-10-24 05:33:51,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:33:51,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:33:51,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:33:51,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:33:51,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:33:50" (1/3) ... [2024-10-24 05:33:51,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680329fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:33:51, skipping insertion in model container [2024-10-24 05:33:51,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:50" (2/3) ... [2024-10-24 05:33:51,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680329fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:33:51, skipping insertion in model container [2024-10-24 05:33:51,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:33:51" (3/3) ... [2024-10-24 05:33:51,695 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-60.i [2024-10-24 05:33:51,710 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:33:51,711 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:33:51,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:33:51,781 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;@39aadf13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:33:51,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:33:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:33:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-24 05:33:51,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:33:51,807 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:33:51,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:33:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:33:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1280516858, now seen corresponding path program 1 times [2024-10-24 05:33:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:33:51,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500254030] [2024-10-24 05:33:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:33:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:33:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:33:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:33:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:33:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 05:33:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:33:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 05:33:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 05:33:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:33:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:33:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:33:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:33:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:33:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:33:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:33:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:33:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:33:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:33:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:33:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:33:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:33:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 05:33:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 05:33:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 05:33:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 05:33:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 05:33:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 05:33:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 05:33:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:33:52,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500254030] [2024-10-24 05:33:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500254030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:33:52,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:33:52,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:33:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522639190] [2024-10-24 05:33:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:33:52,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:33:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:33:52,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:33:52,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:33:52,339 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 05:33:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:33:52,384 INFO L93 Difference]: Finished difference Result 133 states and 238 transitions. [2024-10-24 05:33:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:33:52,388 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-10-24 05:33:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:33:52,396 INFO L225 Difference]: With dead ends: 133 [2024-10-24 05:33:52,396 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 05:33:52,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:33:52,406 INFO L432 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:33:52,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:33:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 05:33:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 05:33:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:33:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-24 05:33:52,465 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 159 [2024-10-24 05:33:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:33:52,466 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-24 05:33:52,467 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 05:33:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-24 05:33:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-24 05:33:52,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:33:52,471 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:33:52,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:33:52,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:33:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:33:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1765973070, now seen corresponding path program 1 times [2024-10-24 05:33:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:33:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323123249] [2024-10-24 05:33:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:33:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:33:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:33:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:33:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:33:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 05:33:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:33:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 05:33:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 05:33:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:33:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:33:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:33:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:33:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:33:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:33:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:33:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:33:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:33:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:33:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:33:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:33:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:33:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 05:33:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 05:33:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 05:33:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 05:33:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 05:33:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 05:33:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 05:33:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:33:52,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323123249] [2024-10-24 05:33:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323123249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:33:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:33:52,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:33:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565247949] [2024-10-24 05:33:52,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:33:52,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:33:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:33:52,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:33:52,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:33:52,848 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:33:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:33:52,919 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2024-10-24 05:33:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:33:52,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-24 05:33:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:33:52,925 INFO L225 Difference]: With dead ends: 166 [2024-10-24 05:33:52,925 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 05:33:52,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:33:52,927 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:33:52,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 232 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:33:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 05:33:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-10-24 05:33:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 05:33:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2024-10-24 05:33:52,959 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 159 [2024-10-24 05:33:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:33:52,962 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2024-10-24 05:33:52,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:33:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2024-10-24 05:33:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 05:33:52,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:33:52,966 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:33:52,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:33:52,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:33:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:33:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash 80826283, now seen corresponding path program 1 times [2024-10-24 05:33:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:33:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056965280] [2024-10-24 05:33:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:33:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:33:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:33:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:33:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:33:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 05:33:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:33:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 05:33:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 05:33:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:33:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:33:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:33:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:33:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:33:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:33:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:33:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:33:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:33:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:33:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:33:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:33:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:33:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 05:33:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 05:33:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 05:33:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 05:33:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 05:33:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 05:33:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:33:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 05:33:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:33:53,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056965280] [2024-10-24 05:33:53,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056965280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:33:53,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:33:53,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:33:53,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807117697] [2024-10-24 05:33:53,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:33:53,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:33:53,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:33:53,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:33:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:33:53,240 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:33:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:33:53,313 INFO L93 Difference]: Finished difference Result 219 states and 332 transitions. [2024-10-24 05:33:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:33:53,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-24 05:33:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:33:53,320 INFO L225 Difference]: With dead ends: 219 [2024-10-24 05:33:53,322 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 05:33:53,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:33:53,325 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 20 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:33:53,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 184 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:33:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 05:33:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2024-10-24 05:33:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 63 states have internal predecessors, (81), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 05:33:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 161 transitions. [2024-10-24 05:33:53,359 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 161 transitions. Word has length 160 [2024-10-24 05:33:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:33:53,359 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 161 transitions. [2024-10-24 05:33:53,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:33:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2024-10-24 05:33:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 05:33:53,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:33:53,367 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:33:53,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:33:53,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:33:53,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:33:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1855833645, now seen corresponding path program 1 times [2024-10-24 05:33:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:33:53,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414142453] [2024-10-24 05:33:53,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:33:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:33:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:33:53,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433361216] [2024-10-24 05:33:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:33:53,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:33:53,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:33:53,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:33:53,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:33:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:33:53,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:33:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:33:53,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:33:53,921 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:33:53,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:33:53,934 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-24 05:33:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:33:54,129 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 05:33:54,236 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:33:54,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:33:54 BoogieIcfgContainer [2024-10-24 05:33:54,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:33:54,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:33:54,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:33:54,241 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:33:54,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:33:51" (3/4) ... [2024-10-24 05:33:54,243 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:33:54,244 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:33:54,245 INFO L158 Benchmark]: Toolchain (without parser) took 3659.34ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 93.6MB in the beginning and 94.9MB in the end (delta: -1.3MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-10-24 05:33:54,245 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:33:54,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.24ms. Allocated memory is still 138.4MB. Free memory was 93.6MB in the beginning and 78.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:33:54,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.05ms. Allocated memory is still 138.4MB. Free memory was 78.5MB in the beginning and 75.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:33:54,246 INFO L158 Benchmark]: Boogie Preprocessor took 59.45ms. Allocated memory is still 138.4MB. Free memory was 75.6MB in the beginning and 72.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:33:54,246 INFO L158 Benchmark]: RCFGBuilder took 596.34ms. Allocated memory is still 138.4MB. Free memory was 72.7MB in the beginning and 91.0MB in the end (delta: -18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 05:33:54,247 INFO L158 Benchmark]: TraceAbstraction took 2553.42ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 90.3MB in the beginning and 96.0MB in the end (delta: -5.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-10-24 05:33:54,247 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 188.7MB. Free memory was 96.0MB in the beginning and 94.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:33:54,248 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.17ms. Allocated memory is still 100.7MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.24ms. Allocated memory is still 138.4MB. Free memory was 93.6MB in the beginning and 78.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.05ms. Allocated memory is still 138.4MB. Free memory was 78.5MB in the beginning and 75.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.45ms. Allocated memory is still 138.4MB. Free memory was 75.6MB in the beginning and 72.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 596.34ms. Allocated memory is still 138.4MB. Free memory was 72.7MB in the beginning and 91.0MB in the end (delta: -18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2553.42ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 90.3MB in the beginning and 96.0MB in the end (delta: -5.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 188.7MB. Free memory was 96.0MB in the beginning and 94.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 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 141. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] float var_1_3 = 10.7; [L25] float var_1_4 = 7.8; [L26] float var_1_5 = 99.5; [L27] signed short int var_1_6 = 16; [L28] signed short int var_1_7 = 256; [L29] float var_1_8 = 256.6; [L30] unsigned char var_1_9 = 50; [L31] unsigned char var_1_10 = 5; [L32] double var_1_11 = 127.75; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] double var_1_15 = 15.2; [L37] double var_1_16 = 256.5; [L38] double var_1_17 = 256.5; [L39] double var_1_18 = 0.0; [L40] double var_1_19 = 9.7; [L41] unsigned long int var_1_20 = 10000000; [L42] unsigned long int var_1_21 = 4008920074; [L43] unsigned long int var_1_22 = 128; [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] FCALL updateLastVariables() [L149] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L96] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L97] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L98] var_1_3 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L99] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L101] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L103] var_1_5 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L104] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L105] var_1_6 = __VERIFIER_nondet_short() [L106] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L106] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L107] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L107] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L108] var_1_7 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L110] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L110] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L113] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L113] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L114] var_1_12 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L115] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L116] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L116] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L117] var_1_13 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L119] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L119] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L120] var_1_14 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L121] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L122] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L122] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L123] var_1_15 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L124] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L125] var_1_17 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L126] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L127] var_1_18 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L128] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L129] var_1_19 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L130] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L131] var_1_21 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L132] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L133] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L133] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L134] var_1_22 = __VERIFIER_nondet_ulong() [L135] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L135] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L136] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L136] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L149] RET updateVariables() [L150] CALL step() [L47] COND FALSE !(\read(var_1_2)) [L54] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L56] COND FALSE !((- var_1_5) <= var_1_4) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L61] signed long int stepLocal_0 = var_1_6 * 1; VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L62] COND FALSE !(var_1_8 < (var_1_3 + var_1_5)) [L69] var_1_9 = var_1_10 VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L71] COND TRUE (var_1_8 >= var_1_3) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14)) VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L72] COND FALSE !(\read(var_1_2)) [L75] var_1_11 = var_1_15 VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L80] signed short int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_0=130, stepLocal_1=129, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L81] COND FALSE !(((var_1_10 * var_1_7) + var_1_9) > stepLocal_1) VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L84] COND TRUE \read(var_1_13) [L85] var_1_20 = (((((var_1_7) > (128u)) ? (var_1_7) : (128u))) + var_1_9) VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=129, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return (((((var_1_2 ? (((var_1_3 / var_1_4) <= var_1_5) ? (var_1_1 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_1 == ((signed short int) var_1_6))) : (var_1_1 == ((signed short int) var_1_7))) && (((- var_1_5) <= var_1_4) ? (((var_1_3 <= var_1_4) || var_1_2) ? (var_1_8 == ((float) 3.3f)) : 1) : 1)) && ((var_1_8 < (var_1_3 + var_1_5)) ? ((((((var_1_7) < (var_1_1)) ? (var_1_7) : (var_1_1))) > (var_1_6 * 1)) ? (var_1_9 == ((unsigned char) var_1_10)) : (var_1_9 == ((unsigned char) var_1_10))) : (var_1_9 == ((unsigned char) var_1_10)))) && (((var_1_8 >= var_1_3) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) ? (var_1_2 ? (var_1_11 == ((double) var_1_15)) : (var_1_11 == ((double) var_1_15))) : (var_1_11 == ((double) var_1_15)))) && ((((var_1_10 * var_1_7) + var_1_9) > var_1_1) ? (var_1_16 == ((double) (var_1_17 - (var_1_18 - var_1_19)))) : 1)) && (var_1_13 ? (var_1_20 == ((unsigned long int) (((((var_1_7) > (128u)) ? (var_1_7) : (128u))) + var_1_9))) : ((var_1_7 >= var_1_6) ? (var_1_20 == ((unsigned long int) (var_1_21 - var_1_9))) : (var_1_20 == ((unsigned long int) var_1_22)))) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=129, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L19] reach_error() VAL [isInitial=1, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=129, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 515 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 334 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:33:54,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.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 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:33:56,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:33:56,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:33:56,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:33:56,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:33:56,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:33:56,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:33:56,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:33:56,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:33:56,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:33:56,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:33:56,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:33:56,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:33:56,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:33:56,760 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:33:56,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:33:56,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:33:56,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:33:56,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:33:56,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:33:56,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:33:56,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:33:56,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:33:56,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:33:56,766 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:33:56,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:33:56,767 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:33:56,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:33:56,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:33:56,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:33:56,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:33:56,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:33:56,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:33:56,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:33:56,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:33:56,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:33:56,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:33:56,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:33:56,771 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:33:56,771 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:33:56,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:33:56,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:33:56,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:33:56,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:33:56,773 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:33:56,773 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 -> 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 [2024-10-24 05:33:57,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:33:57,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:33:57,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:33:57,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:33:57,128 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:33:57,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-10-24 05:33:58,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:33:58,910 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:33:58,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-10-24 05:33:58,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eec834b4/6d036e914f254e62a6957fdc737db952/FLAGc941de869 [2024-10-24 05:33:59,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eec834b4/6d036e914f254e62a6957fdc737db952 [2024-10-24 05:33:59,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:33:59,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:33:59,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:33:59,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:33:59,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:33:59,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7039cad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59, skipping insertion in model container [2024-10-24 05:33:59,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:33:59,500 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-60.i[917,930] [2024-10-24 05:33:59,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:33:59,596 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:33:59,610 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-60.i[917,930] [2024-10-24 05:33:59,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:33:59,667 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:33:59,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59 WrapperNode [2024-10-24 05:33:59,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:33:59,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:33:59,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:33:59,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:33:59,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,732 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-10-24 05:33:59,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:33:59,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:33:59,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:33:59,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:33:59,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:33:59,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:33:59,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:33:59,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:33:59,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:33:59,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (1/1) ... [2024-10-24 05:33:59,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:33:59,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:33:59,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:33:59,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:33:59,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:33:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:33:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:33:59,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:33:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:33:59,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:33:59,982 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:33:59,984 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:34:05,570 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 05:34:05,570 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:34:05,615 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:34:05,615 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:34:05,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:34:05 BoogieIcfgContainer [2024-10-24 05:34:05,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:34:05,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:34:05,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:34:05,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:34:05,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:33:59" (1/3) ... [2024-10-24 05:34:05,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5efd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:34:05, skipping insertion in model container [2024-10-24 05:34:05,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:33:59" (2/3) ... [2024-10-24 05:34:05,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5efd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:34:05, skipping insertion in model container [2024-10-24 05:34:05,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:34:05" (3/3) ... [2024-10-24 05:34:05,628 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-60.i [2024-10-24 05:34:05,644 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:34:05,644 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:34:05,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:34:05,717 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;@36b2b41c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:34:05,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:34:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:34:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-24 05:34:05,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:34:05,734 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:34:05,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:34:05,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:34:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1280516858, now seen corresponding path program 1 times [2024-10-24 05:34:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:34:05,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907293489] [2024-10-24 05:34:05,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:34:05,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:34:05,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:34:05,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:34:05,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:34:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:34:06,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:34:06,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:34:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-24 05:34:06,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:34:06,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:34:06,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907293489] [2024-10-24 05:34:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907293489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:34:06,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:34:06,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:34:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562212413] [2024-10-24 05:34:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:34:06,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:34:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:34:06,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:34:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:34:06,411 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 05:34:10,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:34:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:34:10,550 INFO L93 Difference]: Finished difference Result 133 states and 238 transitions. [2024-10-24 05:34:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:34:10,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-10-24 05:34:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:34:10,586 INFO L225 Difference]: With dead ends: 133 [2024-10-24 05:34:10,586 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 05:34:10,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:34:10,592 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:34:10,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 05:34:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 05:34:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 05:34:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:34:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-24 05:34:10,646 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 159 [2024-10-24 05:34:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:34:10,646 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-24 05:34:10,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 05:34:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-24 05:34:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-24 05:34:10,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:34:10,650 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:34:10,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 05:34:10,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:34:10,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:34:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:34:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1765973070, now seen corresponding path program 1 times [2024-10-24 05:34:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:34:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966098921] [2024-10-24 05:34:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:34:10,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:34:10,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:34:10,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:34:10,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:34:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:34:11,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 05:34:11,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:34:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 05:34:11,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:34:11,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:34:11,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966098921] [2024-10-24 05:34:11,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966098921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:34:11,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:34:11,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:34:11,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015111800] [2024-10-24 05:34:11,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:34:11,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:34:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:34:11,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:34:11,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:34:11,430 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:34:14,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:34:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:34:14,773 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2024-10-24 05:34:14,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:34:14,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-24 05:34:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:34:14,779 INFO L225 Difference]: With dead ends: 166 [2024-10-24 05:34:14,779 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 05:34:14,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:34:14,783 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 48 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:34:14,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 231 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 05:34:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 05:34:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-10-24 05:34:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 05:34:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2024-10-24 05:34:14,812 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 159 [2024-10-24 05:34:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:34:14,813 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2024-10-24 05:34:14,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:34:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2024-10-24 05:34:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 05:34:14,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:34:14,816 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:34:14,837 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 (3)] Ended with exit code 0 [2024-10-24 05:34:15,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:34:15,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:34:15,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:34:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash 80826283, now seen corresponding path program 1 times [2024-10-24 05:34:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:34:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406130181] [2024-10-24 05:34:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:34:15,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:34:15,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:34:15,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:34:15,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 05:34:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:34:15,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 05:34:15,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:34:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 05:34:15,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:34:15,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:34:15,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406130181] [2024-10-24 05:34:15,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406130181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:34:15,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:34:15,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:34:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039450111] [2024-10-24 05:34:15,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:34:15,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:34:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:34:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:34:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:34:15,571 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:34:19,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:34:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:34:20,058 INFO L93 Difference]: Finished difference Result 219 states and 332 transitions. [2024-10-24 05:34:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:34:20,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-24 05:34:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:34:20,077 INFO L225 Difference]: With dead ends: 219 [2024-10-24 05:34:20,077 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 05:34:20,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:34:20,082 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 20 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:34:20,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 183 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-24 05:34:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 05:34:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2024-10-24 05:34:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 63 states have internal predecessors, (81), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 05:34:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 161 transitions. [2024-10-24 05:34:20,112 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 161 transitions. Word has length 160 [2024-10-24 05:34:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:34:20,113 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 161 transitions. [2024-10-24 05:34:20,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:34:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2024-10-24 05:34:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 05:34:20,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:34:20,117 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:34:20,137 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 (4)] Ended with exit code 0 [2024-10-24 05:34:20,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:34:20,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:34:20,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:34:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1855833645, now seen corresponding path program 1 times [2024-10-24 05:34:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:34:20,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689424800] [2024-10-24 05:34:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:34:20,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:34:20,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:34:20,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:34:20,325 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 (5)] Waiting until timeout for monitored process [2024-10-24 05:34:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:34:20,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 05:34:20,833 INFO L278 TraceCheckSpWp]: Computing forward predicates...