./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:43:18,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:43:18,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:43:18,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:43:18,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:43:18,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:43:18,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:43:18,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:43:18,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:43:18,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:43:18,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:43:18,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:43:18,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:43:18,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:43:18,839 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:43:18,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:43:18,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:43:18,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:43:18,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:43:18,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:43:18,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:43:18,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:43:18,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:43:18,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:43:18,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:43:18,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:43:18,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:43:18,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:43:18,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:43:18,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:43:18,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:43:18,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:43:18,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:43:18,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:43:18,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:43:18,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:43:18,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:43:18,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:43:18,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:43:18,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:43:18,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:43:18,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:43:18,854 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 [2024-10-14 07:43:19,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:43:19,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:43:19,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:43:19,118 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:43:19,118 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:43:19,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-10-14 07:43:20,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:43:20,767 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:43:20,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-10-14 07:43:20,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f97014572/bac2314336754dd9ba7e57f9a0a1f95a/FLAGae1906251 [2024-10-14 07:43:20,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f97014572/bac2314336754dd9ba7e57f9a0a1f95a [2024-10-14 07:43:20,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:43:20,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:43:20,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:43:20,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:43:20,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:43:20,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:43:20" (1/1) ... [2024-10-14 07:43:20,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a2203f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:20, skipping insertion in model container [2024-10-14 07:43:20,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:43:20" (1/1) ... [2024-10-14 07:43:20,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:43:20,941 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i[917,930] [2024-10-14 07:43:21,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:43:21,018 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:43:21,028 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i[917,930] [2024-10-14 07:43:21,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:43:21,078 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:43:21,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21 WrapperNode [2024-10-14 07:43:21,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:43:21,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:43:21,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:43:21,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:43:21,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,130 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-14 07:43:21,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:43:21,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:43:21,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:43:21,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:43:21,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,169 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:43:21,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:43:21,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:43:21,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:43:21,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:43:21,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (1/1) ... [2024-10-14 07:43:21,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:43:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:43:21,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:43:21,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:43:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:43:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:43:21,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:43:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:43:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:43:21,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:43:21,343 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:43:21,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:43:21,576 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 07:43:21,576 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:43:21,624 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:43:21,625 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:43:21,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:43:21 BoogieIcfgContainer [2024-10-14 07:43:21,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:43:21,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:43:21,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:43:21,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:43:21,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:43:20" (1/3) ... [2024-10-14 07:43:21,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d58cd3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:43:21, skipping insertion in model container [2024-10-14 07:43:21,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:21" (2/3) ... [2024-10-14 07:43:21,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d58cd3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:43:21, skipping insertion in model container [2024-10-14 07:43:21,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:43:21" (3/3) ... [2024-10-14 07:43:21,632 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-60.i [2024-10-14 07:43:21,647 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:43:21,647 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:43:21,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:43:21,710 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;@fdb65e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:43:21,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:43:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:43:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:43:21,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:43:21,730 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:43:21,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:43:21,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:43:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1280516858, now seen corresponding path program 1 times [2024-10-14 07:43:21,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:43:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567646719] [2024-10-14 07:43:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:43:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:21,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:43:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:21,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:43:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:21,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:43:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:43:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:21,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:43:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:43:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:43:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:43:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:43:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:43:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:43:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:43:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:43:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:43:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:43:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:43:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:43:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:43:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:43:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:43:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:43:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 07:43:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 07:43:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 07:43:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 07:43:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 07:43:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:43:22,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:43:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567646719] [2024-10-14 07:43:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567646719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:43:22,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:43:22,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:43:22,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909125134] [2024-10-14 07:43:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:43:22,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:43:22,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:43:22,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:43:22,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:43:22,211 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:43:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:43:22,262 INFO L93 Difference]: Finished difference Result 133 states and 238 transitions. [2024-10-14 07:43:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:43:22,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-10-14 07:43:22,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:43:22,271 INFO L225 Difference]: With dead ends: 133 [2024-10-14 07:43:22,273 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 07:43:22,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:43:22,281 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:43:22,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:43:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 07:43:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 07:43:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:43:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-14 07:43:22,326 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 159 [2024-10-14 07:43:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:43:22,326 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-14 07:43:22,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:43:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-14 07:43:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:43:22,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:43:22,330 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:43:22,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:43:22,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:43:22,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:43:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1765973070, now seen corresponding path program 1 times [2024-10-14 07:43:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:43:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013294060] [2024-10-14 07:43:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:43:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:43:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:43:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:43:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:43:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:43:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:43:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:43:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:43:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:43:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:43:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:43:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:43:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:43:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:43:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:43:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:43:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:43:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:43:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:43:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:43:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:43:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 07:43:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 07:43:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 07:43:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 07:43:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 07:43:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:43:22,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:43:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013294060] [2024-10-14 07:43:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013294060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:43:22,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:43:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:43:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501567602] [2024-10-14 07:43:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:43:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:43:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:43:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:43:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:43:22,714 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:43:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:43:22,776 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2024-10-14 07:43:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:43:22,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-14 07:43:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:43:22,782 INFO L225 Difference]: With dead ends: 166 [2024-10-14 07:43:22,783 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 07:43:22,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:43:22,787 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:43:22,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 232 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:43:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 07:43:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-10-14 07:43:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 07:43:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2024-10-14 07:43:22,819 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 159 [2024-10-14 07:43:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:43:22,820 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2024-10-14 07:43:22,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:43:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2024-10-14 07:43:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 07:43:22,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:43:22,825 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:43:22,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:43:22,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:43:22,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:43:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash 80826283, now seen corresponding path program 1 times [2024-10-14 07:43:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:43:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151947407] [2024-10-14 07:43:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:22,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:43:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:43:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:43:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:43:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:43:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:43:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:43:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:43:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:43:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:43:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:43:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:43:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:43:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:43:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:43:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:43:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:43:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:43:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:43:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:43:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:43:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:43:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 07:43:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 07:43:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 07:43:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 07:43:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 07:43:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:43:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:43:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151947407] [2024-10-14 07:43:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151947407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:43:23,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:43:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:43:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710677904] [2024-10-14 07:43:23,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:43:23,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:43:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:43:23,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:43:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:43:23,048 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:43:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:43:23,113 INFO L93 Difference]: Finished difference Result 219 states and 332 transitions. [2024-10-14 07:43:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:43:23,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-14 07:43:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:43:23,118 INFO L225 Difference]: With dead ends: 219 [2024-10-14 07:43:23,118 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 07:43:23,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:43:23,120 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 20 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:43:23,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 184 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:43:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 07:43:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2024-10-14 07:43:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 63 states have internal predecessors, (81), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 07:43:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 161 transitions. [2024-10-14 07:43:23,136 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 161 transitions. Word has length 160 [2024-10-14 07:43:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:43:23,137 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 161 transitions. [2024-10-14 07:43:23,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:43:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2024-10-14 07:43:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 07:43:23,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:43:23,140 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:43:23,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:43:23,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:43:23,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:43:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1855833645, now seen corresponding path program 1 times [2024-10-14 07:43:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:43:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959770141] [2024-10-14 07:43:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:43:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:43:23,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652841392] [2024-10-14 07:43:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:23,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:43:23,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:43:23,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:43:23,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 07:43:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:43:23,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:43:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:43:23,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:43:23,656 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:43:23,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:43:23,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 07:43:23,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:43:23,864 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 07:43:23,963 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:43:23,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:43:23 BoogieIcfgContainer [2024-10-14 07:43:23,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:43:23,966 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:43:23,966 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:43:23,966 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:43:23,967 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:43:21" (3/4) ... [2024-10-14 07:43:23,969 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:43:23,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:43:23,970 INFO L158 Benchmark]: Toolchain (without parser) took 3173.97ms. Allocated memory was 182.5MB in the beginning and 281.0MB in the end (delta: 98.6MB). Free memory was 124.7MB in the beginning and 210.7MB in the end (delta: -86.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-14 07:43:23,970 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:43:23,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.66ms. Allocated memory is still 182.5MB. Free memory was 124.7MB in the beginning and 110.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:43:23,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.92ms. Allocated memory is still 182.5MB. Free memory was 110.2MB in the beginning and 107.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:43:23,971 INFO L158 Benchmark]: Boogie Preprocessor took 48.88ms. Allocated memory is still 182.5MB. Free memory was 107.5MB in the beginning and 104.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:43:23,971 INFO L158 Benchmark]: RCFGBuilder took 438.89ms. Allocated memory is still 182.5MB. Free memory was 104.5MB in the beginning and 82.0MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 07:43:23,972 INFO L158 Benchmark]: TraceAbstraction took 2338.73ms. Allocated memory was 182.5MB in the beginning and 281.0MB in the end (delta: 98.6MB). Free memory was 81.4MB in the beginning and 211.8MB in the end (delta: -130.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:43:23,972 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 281.0MB. Free memory is still 210.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:43:23,973 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.12ms. Allocated memory is still 182.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.66ms. Allocated memory is still 182.5MB. Free memory was 124.7MB in the beginning and 110.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.92ms. Allocated memory is still 182.5MB. Free memory was 110.2MB in the beginning and 107.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.88ms. Allocated memory is still 182.5MB. Free memory was 107.5MB in the beginning and 104.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.89ms. Allocated memory is still 182.5MB. Free memory was 104.5MB in the beginning and 82.0MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2338.73ms. Allocated memory was 182.5MB in the beginning and 281.0MB in the end (delta: 98.6MB). Free memory was 81.4MB in the beginning and 211.8MB in the end (delta: -130.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 281.0MB. Free memory is still 210.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 141. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] float var_1_3 = 10.7; [L25] float var_1_4 = 7.8; [L26] float var_1_5 = 99.5; [L27] signed short int var_1_6 = 16; [L28] signed short int var_1_7 = 256; [L29] float var_1_8 = 256.6; [L30] unsigned char var_1_9 = 50; [L31] unsigned char var_1_10 = 5; [L32] double var_1_11 = 127.75; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] double var_1_15 = 15.2; [L37] double var_1_16 = 256.5; [L38] double var_1_17 = 256.5; [L39] double var_1_18 = 0.0; [L40] double var_1_19 = 9.7; [L41] unsigned long int var_1_20 = 10000000; [L42] unsigned long int var_1_21 = 4008920074; [L43] unsigned long int var_1_22 = 128; [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] FCALL updateLastVariables() [L149] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L96] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L97] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L98] var_1_3 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L99] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L101] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L103] var_1_5 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L104] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L105] var_1_6 = __VERIFIER_nondet_short() [L106] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L106] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L107] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L107] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L108] var_1_7 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L110] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L110] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L113] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L113] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L114] var_1_12 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L115] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L116] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L116] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L117] var_1_13 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L119] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L119] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L120] var_1_14 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L121] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L122] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L122] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L123] var_1_15 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L124] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L125] var_1_17 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L126] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L127] var_1_18 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L128] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L129] var_1_19 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L130] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L131] var_1_21 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L132] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L133] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L133] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L134] var_1_22 = __VERIFIER_nondet_ulong() [L135] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L135] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L136] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L136] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L149] RET updateVariables() [L150] CALL step() [L47] COND FALSE !(\read(var_1_2)) [L54] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L56] COND FALSE !((- var_1_5) <= var_1_4) VAL [isInitial=1, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L61] signed long int stepLocal_0 = var_1_6 * 1; VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=50] [L62] COND FALSE !(var_1_8 < (var_1_3 + var_1_5)) [L69] var_1_9 = var_1_10 VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L71] COND TRUE (var_1_8 >= var_1_3) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14)) VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L72] COND FALSE !(\read(var_1_2)) [L75] var_1_11 = var_1_15 VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L80] signed short int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_0=130, stepLocal_1=129, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L81] COND FALSE !(((var_1_10 * var_1_7) + var_1_9) > stepLocal_1) VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L84] COND TRUE \read(var_1_13) [L85] var_1_20 = (((((var_1_7) > (128u)) ? (var_1_7) : (128u))) + var_1_9) VAL [isInitial=1, stepLocal_0=130, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=129, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return (((((var_1_2 ? (((var_1_3 / var_1_4) <= var_1_5) ? (var_1_1 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_1 == ((signed short int) var_1_6))) : (var_1_1 == ((signed short int) var_1_7))) && (((- var_1_5) <= var_1_4) ? (((var_1_3 <= var_1_4) || var_1_2) ? (var_1_8 == ((float) 3.3f)) : 1) : 1)) && ((var_1_8 < (var_1_3 + var_1_5)) ? ((((((var_1_7) < (var_1_1)) ? (var_1_7) : (var_1_1))) > (var_1_6 * 1)) ? (var_1_9 == ((unsigned char) var_1_10)) : (var_1_9 == ((unsigned char) var_1_10))) : (var_1_9 == ((unsigned char) var_1_10)))) && (((var_1_8 >= var_1_3) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) ? (var_1_2 ? (var_1_11 == ((double) var_1_15)) : (var_1_11 == ((double) var_1_15))) : (var_1_11 == ((double) var_1_15)))) && ((((var_1_10 * var_1_7) + var_1_9) > var_1_1) ? (var_1_16 == ((double) (var_1_17 - (var_1_18 - var_1_19)))) : 1)) && (var_1_13 ? (var_1_20 == ((unsigned long int) (((((var_1_7) > (128u)) ? (var_1_7) : (128u))) + var_1_9))) : ((var_1_7 >= var_1_6) ? (var_1_20 == ((unsigned long int) (var_1_21 - var_1_9))) : (var_1_20 == ((unsigned long int) var_1_22)))) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=129, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] [L19] reach_error() VAL [isInitial=1, var_1_10=256, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=129, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=130, var_1_7=129, var_1_8=1283/5, var_1_9=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 515 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 334 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:43:24,009 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-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:43:26,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:43:26,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:43:26,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:43:26,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:43:26,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:43:26,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:43:26,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:43:26,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:43:26,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:43:26,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:43:26,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:43:26,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:43:26,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:43:26,258 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:43:26,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:43:26,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:43:26,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:43:26,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:43:26,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:43:26,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:43:26,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:43:26,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:43:26,259 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:43:26,259 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:43:26,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:43:26,260 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:43:26,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:43:26,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:43:26,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:43:26,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:43:26,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:43:26,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:43:26,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:43:26,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:43:26,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:43:26,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:43:26,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:43:26,261 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:43:26,261 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:43:26,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:43:26,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:43:26,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:43:26,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:43:26,264 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:43:26,264 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 [2024-10-14 07:43:26,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:43:26,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:43:26,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:43:26,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:43:26,569 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:43:26,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-10-14 07:43:28,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:43:28,291 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:43:28,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-10-14 07:43:28,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0644e98ca/2ae675ee75624effb501de1ab926d660/FLAG0ac801c03 [2024-10-14 07:43:28,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0644e98ca/2ae675ee75624effb501de1ab926d660 [2024-10-14 07:43:28,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:43:28,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:43:28,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:43:28,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:43:28,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:43:28,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:43:28" (1/1) ... [2024-10-14 07:43:28,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcc7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:28, skipping insertion in model container [2024-10-14 07:43:28,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:43:28" (1/1) ... [2024-10-14 07:43:28,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:43:28,845 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i[917,930] [2024-10-14 07:43:28,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:43:28,939 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:43:28,963 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i[917,930] [2024-10-14 07:43:29,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:43:29,027 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:43:29,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29 WrapperNode [2024-10-14 07:43:29,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:43:29,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:43:29,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:43:29,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:43:29,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,080 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-10-14 07:43:29,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:43:29,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:43:29,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:43:29,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:43:29,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,128 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:43:29,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:43:29,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:43:29,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:43:29,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:43:29,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (1/1) ... [2024-10-14 07:43:29,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:43:29,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:43:29,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:43:29,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:43:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:43:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:43:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:43:29,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:43:29,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:43:29,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:43:29,315 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:43:29,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:43:35,590 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 07:43:35,590 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:43:35,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:43:35,646 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:43:35,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:43:35 BoogieIcfgContainer [2024-10-14 07:43:35,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:43:35,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:43:35,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:43:35,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:43:35,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:43:28" (1/3) ... [2024-10-14 07:43:35,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8dd4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:43:35, skipping insertion in model container [2024-10-14 07:43:35,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:43:29" (2/3) ... [2024-10-14 07:43:35,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8dd4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:43:35, skipping insertion in model container [2024-10-14 07:43:35,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:43:35" (3/3) ... [2024-10-14 07:43:35,658 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-60.i [2024-10-14 07:43:35,678 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:43:35,678 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:43:35,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:43:35,749 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;@2130bb1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:43:35,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:43:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:43:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:43:35,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:43:35,767 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:43:35,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:43:35,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:43:35,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1280516858, now seen corresponding path program 1 times [2024-10-14 07:43:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:43:35,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006399945] [2024-10-14 07:43:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:35,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:43:35,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:43:35,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:43:35,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:43:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:36,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:43:36,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:43:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-14 07:43:36,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:43:36,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:43:36,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006399945] [2024-10-14 07:43:36,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006399945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:43:36,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:43:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:43:36,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684103778] [2024-10-14 07:43:36,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:43:36,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:43:36,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:43:36,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:43:36,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:43:36,321 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:43:40,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:43:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:43:40,436 INFO L93 Difference]: Finished difference Result 133 states and 238 transitions. [2024-10-14 07:43:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:43:40,477 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-10-14 07:43:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:43:40,493 INFO L225 Difference]: With dead ends: 133 [2024-10-14 07:43:40,494 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 07:43:40,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:43:40,504 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:43:40,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 07:43:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 07:43:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 07:43:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:43:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-14 07:43:40,594 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 159 [2024-10-14 07:43:40,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:43:40,600 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-14 07:43:40,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:43:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-14 07:43:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:43:40,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:43:40,603 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:43:40,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 07:43:40,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:43:40,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:43:40,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:43:40,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1765973070, now seen corresponding path program 1 times [2024-10-14 07:43:40,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:43:40,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302083278] [2024-10-14 07:43:40,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:40,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:43:40,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:43:40,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:43:40,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:43:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:41,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 07:43:41,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:43:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:43:41,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:43:41,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:43:41,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302083278] [2024-10-14 07:43:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302083278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:43:41,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:43:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:43:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816992228] [2024-10-14 07:43:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:43:41,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:43:41,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:43:41,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:43:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:43:41,450 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:43:45,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:43:48,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:43:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:43:49,126 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2024-10-14 07:43:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:43:49,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-14 07:43:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:43:49,129 INFO L225 Difference]: With dead ends: 166 [2024-10-14 07:43:49,129 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 07:43:49,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:43:49,131 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 48 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:43:49,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 231 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-10-14 07:43:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 07:43:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-10-14 07:43:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 07:43:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2024-10-14 07:43:49,154 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 159 [2024-10-14 07:43:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:43:49,156 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2024-10-14 07:43:49,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:43:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2024-10-14 07:43:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 07:43:49,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:43:49,160 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:43:49,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 07:43:49,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:43:49,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:43:49,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:43:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash 80826283, now seen corresponding path program 1 times [2024-10-14 07:43:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:43:49,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275400307] [2024-10-14 07:43:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:49,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:43:49,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:43:49,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:43:49,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 07:43:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:49,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 07:43:49,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:43:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:43:49,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:43:49,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:43:49,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275400307] [2024-10-14 07:43:49,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275400307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:43:49,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:43:49,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:43:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823984848] [2024-10-14 07:43:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:43:49,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:43:49,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:43:49,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:43:49,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:43:49,963 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:43:54,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:43:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:43:54,195 INFO L93 Difference]: Finished difference Result 219 states and 332 transitions. [2024-10-14 07:43:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:43:54,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-14 07:43:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:43:54,200 INFO L225 Difference]: With dead ends: 219 [2024-10-14 07:43:54,200 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 07:43:54,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:43:54,203 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 20 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:43:54,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 183 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 07:43:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 07:43:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2024-10-14 07:43:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 63 states have internal predecessors, (81), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 07:43:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 161 transitions. [2024-10-14 07:43:54,219 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 161 transitions. Word has length 160 [2024-10-14 07:43:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:43:54,220 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 161 transitions. [2024-10-14 07:43:54,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:43:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2024-10-14 07:43:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 07:43:54,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:43:54,237 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:43:54,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 07:43:54,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:43:54,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:43:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:43:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1855833645, now seen corresponding path program 1 times [2024-10-14 07:43:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:43:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45599172] [2024-10-14 07:43:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:54,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:43:54,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:43:54,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:43:54,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 07:43:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:55,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 07:43:55,077 INFO L278 TraceCheckSpWp]: Computing forward predicates...