./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:35:16,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:35:16,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:35:16,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:35:16,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:35:16,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:35:16,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:35:16,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:35:16,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:35:16,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:35:16,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:35:16,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:35:16,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:35:16,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:35:16,718 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:35:16,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:35:16,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:35:16,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:35:16,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:35:16,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:35:16,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:35:16,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:35:16,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:35:16,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:35:16,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:35:16,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:35:16,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:35:16,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:35:16,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:35:16,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:35:16,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:35:16,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:35:16,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:35:16,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:35:16,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:35:16,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:35:16,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:35:16,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:35:16,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:35:16,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:35:16,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:35:16,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:35:16,727 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 [2024-11-20 02:35:16,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:35:17,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:35:17,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:35:17,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:35:17,030 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:35:17,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-11-20 02:35:18,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:35:18,714 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:35:18,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-11-20 02:35:18,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf7b24c1/fc9ec23ce3954a6397756318012858b8/FLAGa4bd9d8ce [2024-11-20 02:35:18,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf7b24c1/fc9ec23ce3954a6397756318012858b8 [2024-11-20 02:35:18,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:35:18,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:35:18,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:35:18,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:35:18,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:35:18,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:18" (1/1) ... [2024-11-20 02:35:18,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32242c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:18, skipping insertion in model container [2024-11-20 02:35:18,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:18" (1/1) ... [2024-11-20 02:35:18,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:35:18,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i[917,930] [2024-11-20 02:35:19,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:35:19,052 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:35:19,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i[917,930] [2024-11-20 02:35:19,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:35:19,129 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:35:19,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19 WrapperNode [2024-11-20 02:35:19,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:35:19,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:35:19,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:35:19,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:35:19,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,182 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-20 02:35:19,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:35:19,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:35:19,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:35:19,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:35:19,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,219 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:35:19,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:35:19,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:35:19,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:35:19,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:35:19,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (1/1) ... [2024-11-20 02:35:19,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:35:19,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:35:19,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:35:19,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:35:19,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:35:19,338 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:35:19,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:35:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:35:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:35:19,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:35:19,417 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:35:19,423 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:35:19,729 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 02:35:19,730 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:35:19,743 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:35:19,744 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:35:19,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:19 BoogieIcfgContainer [2024-11-20 02:35:19,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:35:19,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:35:19,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:35:19,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:35:19,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:35:18" (1/3) ... [2024-11-20 02:35:19,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24721907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:19, skipping insertion in model container [2024-11-20 02:35:19,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:19" (2/3) ... [2024-11-20 02:35:19,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24721907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:19, skipping insertion in model container [2024-11-20 02:35:19,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:19" (3/3) ... [2024-11-20 02:35:19,757 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-11.i [2024-11-20 02:35:19,775 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:35:19,776 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:35:19,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:35:19,876 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;@353eb69b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:35:19,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:35:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:35:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 02:35:19,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:19,914 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:19,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:19,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash 468983379, now seen corresponding path program 1 times [2024-11-20 02:35:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:35:19,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691472630] [2024-11-20 02:35:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:35:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:35:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:35:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:35:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:35:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:35:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:35:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:35:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:35:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:35:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:35:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:35:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:35:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:35:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:35:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:35:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:35:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:35:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:35:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:35:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:35:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 02:35:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 02:35:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 02:35:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 02:35:20,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:35:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691472630] [2024-11-20 02:35:20,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691472630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:35:20,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:35:20,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:35:20,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791473345] [2024-11-20 02:35:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:35:20,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:35:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:35:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:35:20,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:35:20,536 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 02:35:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:35:20,563 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2024-11-20 02:35:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:35:20,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2024-11-20 02:35:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:35:20,575 INFO L225 Difference]: With dead ends: 127 [2024-11-20 02:35:20,575 INFO L226 Difference]: Without dead ends: 63 [2024-11-20 02:35:20,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:35:20,585 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:35:20,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:35:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-20 02:35:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-20 02:35:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:35:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-20 02:35:20,647 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 144 [2024-11-20 02:35:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:35:20,651 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-20 02:35:20,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 02:35:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-20 02:35:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 02:35:20,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:20,656 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:20,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:35:20,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:20,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:20,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1934924889, now seen corresponding path program 1 times [2024-11-20 02:35:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:35:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897071522] [2024-11-20 02:35:20,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:35:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:35:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:35:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:35:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:35:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:35:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:35:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:35:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:35:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:35:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:35:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:35:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:35:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:35:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:35:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:35:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:35:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:35:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:35:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:35:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:35:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 02:35:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 02:35:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 02:35:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 02:35:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:35:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897071522] [2024-11-20 02:35:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897071522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:35:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294277162] [2024-11-20 02:35:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:21,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:35:21,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:35:21,949 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-11-20 02:35:21,951 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-11-20 02:35:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:22,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-20 02:35:22,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:35:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 732 proven. 138 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-20 02:35:25,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:35:26,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294277162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:35:26,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:35:26,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23] total 30 [2024-11-20 02:35:26,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334306420] [2024-11-20 02:35:26,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:35:26,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-20 02:35:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:35:26,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 02:35:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=1594, Unknown=0, NotChecked=0, Total=2070 [2024-11-20 02:35:26,433 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 11 states have call successors, (42), 8 states have call predecessors, (42), 11 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-11-20 02:35:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:35:27,961 INFO L93 Difference]: Finished difference Result 183 states and 255 transitions. [2024-11-20 02:35:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-20 02:35:27,962 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 11 states have call successors, (42), 8 states have call predecessors, (42), 11 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 144 [2024-11-20 02:35:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:35:27,968 INFO L225 Difference]: With dead ends: 183 [2024-11-20 02:35:27,969 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 02:35:27,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1190, Invalid=3232, Unknown=0, NotChecked=0, Total=4422 [2024-11-20 02:35:27,974 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 282 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 02:35:27,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 511 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 02:35:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 02:35:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2024-11-20 02:35:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 02:35:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 156 transitions. [2024-11-20 02:35:28,008 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 156 transitions. Word has length 144 [2024-11-20 02:35:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:35:28,009 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 156 transitions. [2024-11-20 02:35:28,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 11 states have call successors, (42), 8 states have call predecessors, (42), 11 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-11-20 02:35:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2024-11-20 02:35:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 02:35:28,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:28,013 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:28,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 02:35:28,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:35:28,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:28,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1658977829, now seen corresponding path program 1 times [2024-11-20 02:35:28,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:35:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161109667] [2024-11-20 02:35:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:35:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:35:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:35:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:35:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:35:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:35:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:35:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:35:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:35:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:35:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:35:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:35:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:35:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:35:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:35:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:35:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:35:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:35:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:35:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:35:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:35:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 02:35:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 02:35:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 02:35:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 02:35:28,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:35:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161109667] [2024-11-20 02:35:28,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161109667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:35:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316706850] [2024-11-20 02:35:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:28,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:35:28,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:35:28,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:35:28,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 02:35:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:29,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-20 02:35:29,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:35:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 758 proven. 108 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-20 02:35:30,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:35:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316706850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:35:31,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:35:31,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 25 [2024-11-20 02:35:31,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478173388] [2024-11-20 02:35:31,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:35:31,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 02:35:31,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:35:31,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 02:35:31,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2024-11-20 02:35:31,963 INFO L87 Difference]: Start difference. First operand 116 states and 156 transitions. Second operand has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-11-20 02:35:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:35:32,774 INFO L93 Difference]: Finished difference Result 233 states and 313 transitions. [2024-11-20 02:35:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 02:35:32,775 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 144 [2024-11-20 02:35:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:35:32,779 INFO L225 Difference]: With dead ends: 233 [2024-11-20 02:35:32,779 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 02:35:32,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=707, Invalid=1843, Unknown=0, NotChecked=0, Total=2550 [2024-11-20 02:35:32,782 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 149 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:35:32,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 281 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:35:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 02:35:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-11-20 02:35:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 79 states have internal predecessors, (97), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 02:35:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 155 transitions. [2024-11-20 02:35:32,816 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 155 transitions. Word has length 144 [2024-11-20 02:35:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:35:32,817 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 155 transitions. [2024-11-20 02:35:32,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-11-20 02:35:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 155 transitions. [2024-11-20 02:35:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:35:32,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:32,823 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:32,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 02:35:33,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-20 02:35:33,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:33,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash -312771240, now seen corresponding path program 1 times [2024-11-20 02:35:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:35:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467770560] [2024-11-20 02:35:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:35:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:35:33,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:35:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:35:33,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:35:33,323 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:35:33,324 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:35:33,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:35:33,331 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 02:35:33,438 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:35:33,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:35:33 BoogieIcfgContainer [2024-11-20 02:35:33,441 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:35:33,442 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:35:33,442 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:35:33,442 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:35:33,443 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:19" (3/4) ... [2024-11-20 02:35:33,446 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:35:33,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:35:33,448 INFO L158 Benchmark]: Toolchain (without parser) took 14703.13ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 112.3MB in the beginning and 224.9MB in the end (delta: -112.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:35:33,448 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:35:33,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.94ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 96.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 02:35:33,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.27ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 93.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 02:35:33,449 INFO L158 Benchmark]: Boogie Preprocessor took 59.32ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 90.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 02:35:33,450 INFO L158 Benchmark]: RCFGBuilder took 500.94ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 72.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 02:35:33,451 INFO L158 Benchmark]: TraceAbstraction took 13693.89ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 71.6MB in the beginning and 224.9MB in the end (delta: -153.3MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. [2024-11-20 02:35:33,451 INFO L158 Benchmark]: Witness Printer took 5.58ms. Allocated memory is still 274.7MB. Free memory is still 224.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:35:33,452 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.20ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.94ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 96.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.27ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 93.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.32ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 90.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.94ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 72.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13693.89ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 71.6MB in the beginning and 224.9MB in the end (delta: -153.3MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. * Witness Printer took 5.58ms. Allocated memory is still 274.7MB. Free memory is still 224.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someUnaryDOUBLEoperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 4; [L28] signed char var_1_7 = 0; [L29] signed char var_1_8 = 16; [L30] signed char var_1_9 = 4; [L31] unsigned long int var_1_10 = 128; [L32] unsigned long int var_1_11 = 1422462314; [L33] signed short int var_1_12 = 8; [L34] float var_1_13 = 49.5; [L35] float var_1_14 = 0.4; [L36] signed short int var_1_15 = -50; [L37] unsigned long int var_1_16 = 1; [L38] unsigned long int var_1_17 = 3609236770; [L39] unsigned long int var_1_18 = 2902762324; [L40] double var_1_19 = 3.8; [L41] double var_1_20 = 255.75; [L42] unsigned short int var_1_21 = 0; VAL [isInitial=0, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L98] var_1_6 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L99] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L100] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L101] var_1_7 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=16, var_1_9=4] [L102] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=16, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=16, var_1_9=4] [L103] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=16, var_1_9=4] [L104] var_1_8 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=4] [L105] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=4] [L106] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=4] [L106] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=4] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L110] var_1_11 = __VERIFIER_nondet_ulong() [L111] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L111] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L112] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L113] var_1_13 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L114] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L115] var_1_14 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L116] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L117] var_1_17 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L118] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L119] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L120] var_1_18 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L121] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L122] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L123] var_1_20 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L124] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L137] RET updateVariables() [L138] CALL step() [L46] var_1_1 = (var_1_2 || (! var_1_3)) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L47] COND TRUE var_1_5 == var_1_6 [L48] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L50] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L51] unsigned long int stepLocal_1 = var_1_10; [L52] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, stepLocal_0=9, stepLocal_1=6174510468, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L53] COND TRUE var_1_6 != stepLocal_1 VAL [isInitial=1, stepLocal_0=9, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L54] COND FALSE !(stepLocal_0 <= var_1_6) VAL [isInitial=1, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L62] COND FALSE !(\read(var_1_2)) [L71] var_1_15 = 5 VAL [isInitial=1, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L73] COND TRUE var_1_13 != var_1_14 [L74] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=5, var_1_16=19, var_1_17=-2, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L82] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) [L83] unsigned char stepLocal_2 = var_1_12 == (var_1_8 - var_1_9); VAL [isInitial=1, stepLocal_2=1, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=5, var_1_16=19, var_1_17=-2, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L84] COND FALSE !(stepLocal_2 && var_1_2) VAL [isInitial=1, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=5, var_1_16=19, var_1_17=-2, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L138] RET step() [L139] CALL, EXPR property() [L129-L130] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_5 == var_1_6) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((var_1_6 != var_1_10) ? ((var_1_8 <= var_1_6) ? (((- var_1_13) >= var_1_14) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_2 ? ((var_1_13 >= var_1_14) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_13 != var_1_14) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_5 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_12 == (var_1_8 - var_1_9)) && var_1_2) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=5, var_1_16=19, var_1_17=-2, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=5, var_1_16=19, var_1_17=-2, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=6174510468, var_1_11=-2147483649, var_1_12=8, var_1_15=5, var_1_16=19, var_1_17=-2, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=-1, var_1_6=-1, var_1_7=10, var_1_8=9, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 445 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 887 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 666 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1231 IncrementalHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 221 mSDtfsCounter, 1231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 690 GetRequests, 575 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=2, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 6572 SizeOfPredicates, 12 NumberOfNonLiveVariables, 667 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4772/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:35:33,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:35:35,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:35:35,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:35:35,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:35:35,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:35:35,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:35:35,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:35:35,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:35:35,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:35:35,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:35:35,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:35:35,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:35:35,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:35:35,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:35:35,979 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:35:35,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:35:35,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:35:35,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:35:35,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:35:35,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:35:35,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:35:35,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:35:35,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:35:35,986 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:35:35,987 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:35:35,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:35:35,987 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:35:35,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:35:35,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:35:35,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:35:35,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:35:35,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:35:35,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:35:35,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:35:35,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:35:35,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:35:35,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:35:35,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:35:35,993 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:35:35,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:35:35,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:35:35,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:35:35,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:35:35,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:35:35,994 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 [2024-11-20 02:35:36,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:35:36,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:35:36,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:35:36,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:35:36,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:35:36,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-11-20 02:35:38,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:35:38,296 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:35:38,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2024-11-20 02:35:38,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428243077/4f14c8b518004bd5a80cf2aab784470f/FLAG781b701e6 [2024-11-20 02:35:38,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428243077/4f14c8b518004bd5a80cf2aab784470f [2024-11-20 02:35:38,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:35:38,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:35:38,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:35:38,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:35:38,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:35:38,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b032dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38, skipping insertion in model container [2024-11-20 02:35:38,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:35:38,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i[917,930] [2024-11-20 02:35:38,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:35:38,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:35:38,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i[917,930] [2024-11-20 02:35:38,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:35:38,824 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:35:38,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38 WrapperNode [2024-11-20 02:35:38,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:35:38,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:35:38,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:35:38,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:35:38,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,884 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-11-20 02:35:38,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:35:38,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:35:38,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:35:38,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:35:38,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,940 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:35:38,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:35:38,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:35:38,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:35:38,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:35:38,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (1/1) ... [2024-11-20 02:35:38,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:35:39,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:35:39,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:35:39,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:35:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:35:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:35:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:35:39,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:35:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:35:39,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:35:39,186 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:35:39,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:35:39,567 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 02:35:39,567 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:35:39,585 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:35:39,585 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:35:39,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:39 BoogieIcfgContainer [2024-11-20 02:35:39,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:35:39,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:35:39,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:35:39,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:35:39,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:35:38" (1/3) ... [2024-11-20 02:35:39,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c5b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:39, skipping insertion in model container [2024-11-20 02:35:39,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:38" (2/3) ... [2024-11-20 02:35:39,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c5b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:39, skipping insertion in model container [2024-11-20 02:35:39,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:39" (3/3) ... [2024-11-20 02:35:39,594 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-11.i [2024-11-20 02:35:39,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:35:39,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:35:39,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:35:39,713 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;@65dfc752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:35:39,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:35:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:35:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 02:35:39,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:39,733 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:39,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:39,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:39,738 INFO L85 PathProgramCache]: Analyzing trace with hash 468983379, now seen corresponding path program 1 times [2024-11-20 02:35:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:35:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788492172] [2024-11-20 02:35:39,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:39,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:35:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:35:39,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:35:39,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:35:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:40,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:35:40,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:35:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-20 02:35:40,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:35:40,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:35:40,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788492172] [2024-11-20 02:35:40,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788492172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:35:40,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:35:40,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:35:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003502339] [2024-11-20 02:35:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:35:40,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:35:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:35:40,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:35:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:35:40,127 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 02:35:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:35:40,166 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2024-11-20 02:35:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:35:40,170 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2024-11-20 02:35:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:35:40,178 INFO L225 Difference]: With dead ends: 127 [2024-11-20 02:35:40,179 INFO L226 Difference]: Without dead ends: 63 [2024-11-20 02:35:40,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:35:40,190 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:35:40,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:35:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-20 02:35:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-20 02:35:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 02:35:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-20 02:35:40,239 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 144 [2024-11-20 02:35:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:35:40,239 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-20 02:35:40,240 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 02:35:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-20 02:35:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 02:35:40,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:40,243 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:40,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:35:40,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:35:40,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:40,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1934924889, now seen corresponding path program 1 times [2024-11-20 02:35:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:35:40,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649314551] [2024-11-20 02:35:40,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:40,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:35:40,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:35:40,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:35:40,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:35:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:40,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 02:35:40,732 INFO L278 TraceCheckSpWp]: Computing forward predicates...