./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.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 baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:15:49,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:15:49,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:15:49,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:15:49,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:15:49,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:15:49,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:15:49,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:15:49,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:15:49,344 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:15:49,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:15:49,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:15:49,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:15:49,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:15:49,348 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:15:49,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:15:49,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:15:49,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:15:49,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:15:49,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:15:49,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:15:49,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:15:49,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:15:49,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:15:49,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:15:49,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:15:49,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:15:49,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:15:49,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:15:49,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:15:49,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:15:49,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:15:49,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:15:49,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:15:49,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:15:49,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:15:49,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:15:49,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:15:49,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:15:49,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:15:49,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:15:49,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:15:49,362 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 -> baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 [2024-11-08 20:15:49,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:15:49,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:15:49,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:15:49,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:15:49,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:15:49,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-08 20:15:51,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:15:51,466 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:15:51,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-08 20:15:51,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76227fcc4/0e5d2982153d4aa287400c71b00865c5/FLAG49a27d176 [2024-11-08 20:15:51,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76227fcc4/0e5d2982153d4aa287400c71b00865c5 [2024-11-08 20:15:51,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:15:51,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:15:51,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:15:51,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:15:51,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:15:51,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:51,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fbb66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51, skipping insertion in model container [2024-11-08 20:15:51,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:51,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:15:51,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2024-11-08 20:15:51,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:15:51,810 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:15:51,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2024-11-08 20:15:51,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:15:51,901 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:15:51,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51 WrapperNode [2024-11-08 20:15:51,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:15:51,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:15:51,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:15:51,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:15:51,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:51,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:51,978 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-08 20:15:51,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:15:51,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:15:51,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:15:51,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:15:51,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:51,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:51,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:52,020 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:15:52,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:52,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:52,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:52,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:52,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:52,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:52,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:15:52,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:15:52,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:15:52,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:15:52,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (1/1) ... [2024-11-08 20:15:52,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:15:52,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:15:52,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:15:52,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:15:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:15:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:15:52,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:15:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:15:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:15:52,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:15:52,226 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:15:52,228 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:15:52,641 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 20:15:52,642 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:15:52,661 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:15:52,662 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:15:52,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:15:52 BoogieIcfgContainer [2024-11-08 20:15:52,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:15:52,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:15:52,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:15:52,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:15:52,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:15:51" (1/3) ... [2024-11-08 20:15:52,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bf5d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:15:52, skipping insertion in model container [2024-11-08 20:15:52,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:15:51" (2/3) ... [2024-11-08 20:15:52,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bf5d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:15:52, skipping insertion in model container [2024-11-08 20:15:52,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:15:52" (3/3) ... [2024-11-08 20:15:52,675 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-08 20:15:52,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:15:52,697 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:15:52,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:15:52,786 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;@7ddeab2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:15:52,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:15:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 20:15:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 20:15:52,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:15:52,810 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:15:52,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:15:52,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:15:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1985306471, now seen corresponding path program 1 times [2024-11-08 20:15:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:15:52,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275589960] [2024-11-08 20:15:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:15:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:15:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:15:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:15:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:15:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:15:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:15:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:15:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:15:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:15:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:15:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:15:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:15:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:15:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:15:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:15:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:15:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:15:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:15:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:15:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:15:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:15:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:15:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 20:15:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:15:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 20:15:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:15:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 20:15:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:15:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:15:53,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:15:53,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275589960] [2024-11-08 20:15:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275589960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:15:53,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:15:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:15:53,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712414595] [2024-11-08 20:15:53,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:15:53,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:15:53,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:15:53,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:15:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:15:53,516 INFO L87 Difference]: Start difference. First operand has 82 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 20:15:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:15:53,601 INFO L93 Difference]: Finished difference Result 157 states and 269 transitions. [2024-11-08 20:15:53,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:15:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2024-11-08 20:15:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:15:53,626 INFO L225 Difference]: With dead ends: 157 [2024-11-08 20:15:53,627 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 20:15:53,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:15:53,682 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:15:53,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:15:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 20:15:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-08 20:15:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 20:15:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-11-08 20:15:53,770 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 175 [2024-11-08 20:15:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:15:53,773 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-11-08 20:15:53,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 20:15:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-11-08 20:15:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 20:15:53,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:15:53,780 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:15:53,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:15:53,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:15:53,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:15:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -396082083, now seen corresponding path program 1 times [2024-11-08 20:15:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:15:53,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865011738] [2024-11-08 20:15:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:15:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:15:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:15:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:15:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:15:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:15:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:15:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:15:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:15:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:15:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:15:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:15:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:15:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:15:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:15:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:15:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:15:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:15:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:15:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:15:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:15:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:15:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:15:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 20:15:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:15:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 20:15:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:15:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 20:15:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:15:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:15:54,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:15:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865011738] [2024-11-08 20:15:54,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865011738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:15:54,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:15:54,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:15:54,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762209783] [2024-11-08 20:15:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:15:54,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:15:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:15:54,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:15:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:15:54,264 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:15:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:15:54,377 INFO L93 Difference]: Finished difference Result 187 states and 275 transitions. [2024-11-08 20:15:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:15:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-11-08 20:15:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:15:54,388 INFO L225 Difference]: With dead ends: 187 [2024-11-08 20:15:54,388 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 20:15:54,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-11-08 20:15:54,394 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 39 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:15:54,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 255 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:15:54,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 20:15:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-11-08 20:15:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 73 states have (on average 1.273972602739726) internal successors, (93), 74 states have internal predecessors, (93), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:15:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-11-08 20:15:54,428 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 175 [2024-11-08 20:15:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:15:54,430 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-11-08 20:15:54,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:15:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-11-08 20:15:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 20:15:54,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:15:54,438 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:15:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:15:54,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:15:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:15:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1675945761, now seen corresponding path program 1 times [2024-11-08 20:15:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:15:54,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403807339] [2024-11-08 20:15:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:15:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:15:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:15:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:15:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:15:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:15:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:15:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:15:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:15:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:15:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:15:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:15:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:15:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:15:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:15:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:15:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:15:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:15:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:15:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:15:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:15:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:15:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:15:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 20:15:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:15:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 20:15:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:15:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 20:15:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:15:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:15:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:15:55,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:15:55,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403807339] [2024-11-08 20:15:55,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403807339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:15:55,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:15:55,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:15:55,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037924932] [2024-11-08 20:15:55,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:15:55,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:15:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:15:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:15:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:15:55,582 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:15:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:15:56,136 INFO L93 Difference]: Finished difference Result 310 states and 456 transitions. [2024-11-08 20:15:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:15:56,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-11-08 20:15:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:15:56,143 INFO L225 Difference]: With dead ends: 310 [2024-11-08 20:15:56,145 INFO L226 Difference]: Without dead ends: 204 [2024-11-08 20:15:56,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:15:56,147 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 83 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:15:56,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 405 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:15:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-08 20:15:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2024-11-08 20:15:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 99 states have internal predecessors, (120), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 20:15:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2024-11-08 20:15:56,198 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 175 [2024-11-08 20:15:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:15:56,199 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2024-11-08 20:15:56,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:15:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2024-11-08 20:15:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 20:15:56,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:15:56,203 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:15:56,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:15:56,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:15:56,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:15:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1689063368, now seen corresponding path program 1 times [2024-11-08 20:15:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:15:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135208347] [2024-11-08 20:15:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:15:56,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:15:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:15:56,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533212494] [2024-11-08 20:15:56,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:15:56,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:15:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:15:56,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:15:56,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 20:15:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:15:56,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:15:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:15:56,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:15:56,747 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:15:56,749 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:15:56,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 20:15:56,951 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-11-08 20:15:56,956 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 20:15:57,114 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:15:57,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:15:57 BoogieIcfgContainer [2024-11-08 20:15:57,118 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:15:57,119 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:15:57,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:15:57,119 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:15:57,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:15:52" (3/4) ... [2024-11-08 20:15:57,122 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:15:57,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:15:57,124 INFO L158 Benchmark]: Toolchain (without parser) took 5623.97ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 109.1MB in the beginning and 105.7MB in the end (delta: 3.4MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-08 20:15:57,125 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 180.4MB. Free memory was 136.3MB in the beginning and 136.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:15:57,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.65ms. Allocated memory is still 180.4MB. Free memory was 108.9MB in the beginning and 148.3MB in the end (delta: -39.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-08 20:15:57,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.01ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 148.0MB in the end (delta: 243.8kB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-08 20:15:57,126 INFO L158 Benchmark]: Boogie Preprocessor took 65.04ms. Allocated memory is still 180.4MB. Free memory was 148.0MB in the beginning and 142.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 20:15:57,126 INFO L158 Benchmark]: RCFGBuilder took 617.24ms. Allocated memory is still 180.4MB. Free memory was 142.8MB in the beginning and 117.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 20:15:57,126 INFO L158 Benchmark]: TraceAbstraction took 4453.09ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 117.6MB in the beginning and 105.7MB in the end (delta: 11.9MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2024-11-08 20:15:57,127 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 228.6MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:15:57,128 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.28ms. Allocated memory is still 180.4MB. Free memory was 136.3MB in the beginning and 136.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.65ms. Allocated memory is still 180.4MB. Free memory was 108.9MB in the beginning and 148.3MB in the end (delta: -39.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.01ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 148.0MB in the end (delta: 243.8kB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.04ms. Allocated memory is still 180.4MB. Free memory was 148.0MB in the beginning and 142.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 617.24ms. Allocated memory is still 180.4MB. Free memory was 142.8MB in the beginning and 117.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4453.09ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 117.6MB in the beginning and 105.7MB in the end (delta: 11.9MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 228.6MB. Free memory is still 105.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 someBinaryDOUBLEComparisonOperation at line 158. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] double var_1_25 = 0.75; [L43] double var_1_26 = 99999999999999.5; [L44] unsigned char var_1_27 = 4; [L45] unsigned char var_1_28 = 64; [L46] signed long int var_1_29 = 128; [L47] signed char var_1_30 = -5; [L48] signed char var_1_31 = -100; [L49] unsigned long int var_1_32 = 1; [L50] unsigned long int var_1_33 = 8; [L51] unsigned char var_1_34 = 5; [L52] double var_1_35 = 10000.225; [L53] signed short int last_1_var_1_21 = -64; [L54] unsigned char last_1_var_1_22 = 25; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L154] last_1_var_1_21 = var_1_21 [L155] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L109] var_1_4 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L111] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L112] var_1_5 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L113] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=1, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=1, var_1_8=1, var_1_9=0] [L115] var_1_6 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_8=1, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L117] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L118] var_1_9 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1] [L119] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1] [L120] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L120] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L121] var_1_10 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L122] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L123] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L123] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L124] var_1_11 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L125] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L126] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L126] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L127] var_1_13 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L129] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L129] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L130] var_1_14 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L131] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L132] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L133] var_1_17 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L134] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L135] var_1_18 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L136] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L137] var_1_19 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L139] var_1_20 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L141] var_1_26 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L142] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L143] var_1_28 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L145] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L146] var_1_31 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L148] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L149] var_1_33 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=0, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L166] RET updateVariables() [L167] CALL step() [L58] var_1_25 = var_1_26 [L59] var_1_27 = var_1_28 [L60] var_1_29 = var_1_28 [L61] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L62] COND FALSE !(((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) < var_1_29) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L65] var_1_34 = var_1_28 [L66] var_1_35 = var_1_26 [L67] signed long int stepLocal_1 = ~ last_1_var_1_21; [L68] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=0, stepLocal_1=63, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L69] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=0, stepLocal_1=63, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L69] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L70] COND FALSE !(stepLocal_0 || var_1_6) [L73] var_1_1 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=25, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L78] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=25, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L81] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=25, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L82] COND FALSE !(var_1_4 > stepLocal_3) [L85] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L87] COND TRUE ((- var_1_11) < 8) || var_1_9 [L88] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L90] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L91] COND TRUE var_1_18 <= var_1_20 [L92] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L98] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L103] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L104] COND TRUE var_1_10 > stepLocal_2 [L105] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L158-L159] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=3, var_1_17=3, var_1_1=25, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=2, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 776 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 409 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 367 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 45 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 877 NumberOfCodeBlocks, 877 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 1821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4212/4212 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 20:15:57,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.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 baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:15:59,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:15:59,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:15:59,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:15:59,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:15:59,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:15:59,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:15:59,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:15:59,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:15:59,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:15:59,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:15:59,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:15:59,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:15:59,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:15:59,783 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:15:59,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:15:59,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:15:59,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:15:59,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:15:59,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:15:59,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:15:59,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:15:59,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:15:59,790 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:15:59,790 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:15:59,790 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:15:59,791 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:15:59,791 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:15:59,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:15:59,791 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:15:59,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:15:59,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:15:59,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:15:59,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:15:59,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:15:59,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:15:59,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:15:59,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:15:59,796 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:15:59,796 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:15:59,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:15:59,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:15:59,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:15:59,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:15:59,799 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 -> baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 [2024-11-08 20:16:00,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:16:00,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:16:00,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:16:00,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:16:00,241 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:16:00,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-08 20:16:01,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:16:02,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:16:02,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-08 20:16:02,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2722bd6fc/146a6dc1994b4ea9a71186574ff694b4/FLAG65c62773b [2024-11-08 20:16:02,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2722bd6fc/146a6dc1994b4ea9a71186574ff694b4 [2024-11-08 20:16:02,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:16:02,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:16:02,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:16:02,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:16:02,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:16:02,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:16:02" (1/1) ... [2024-11-08 20:16:02,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3678adfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:02, skipping insertion in model container [2024-11-08 20:16:02,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:16:02" (1/1) ... [2024-11-08 20:16:02,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:16:02,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2024-11-08 20:16:02,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:16:02,938 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:16:02,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2024-11-08 20:16:03,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:16:03,035 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:16:03,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03 WrapperNode [2024-11-08 20:16:03,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:16:03,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:16:03,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:16:03,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:16:03,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,122 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-08 20:16:03,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:16:03,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:16:03,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:16:03,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:16:03,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:16:03,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:16:03,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:16:03,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:16:03,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:16:03,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (1/1) ... [2024-11-08 20:16:03,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:16:03,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:16:03,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:16:03,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:16:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:16:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:16:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:16:03,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:16:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:16:03,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:16:03,444 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:16:03,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:16:09,513 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 20:16:09,514 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:16:09,531 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:16:09,532 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:16:09,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:16:09 BoogieIcfgContainer [2024-11-08 20:16:09,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:16:09,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:16:09,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:16:09,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:16:09,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:16:02" (1/3) ... [2024-11-08 20:16:09,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751fa325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:16:09, skipping insertion in model container [2024-11-08 20:16:09,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:16:03" (2/3) ... [2024-11-08 20:16:09,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751fa325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:16:09, skipping insertion in model container [2024-11-08 20:16:09,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:16:09" (3/3) ... [2024-11-08 20:16:09,541 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-08 20:16:09,568 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:16:09,568 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:16:09,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:16:09,640 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;@6d63a072, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:16:09,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:16:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 20:16:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 20:16:09,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:09,660 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:16:09,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:09,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1140935840, now seen corresponding path program 1 times [2024-11-08 20:16:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:16:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624350707] [2024-11-08 20:16:09,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:09,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:16:09,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:16:09,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:16:09,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:16:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:10,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:16:10,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:16:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-08 20:16:10,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:16:10,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:16:10,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624350707] [2024-11-08 20:16:10,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624350707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:10,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:16:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91744240] [2024-11-08 20:16:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:16:10,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:16:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:16:10,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:16:10,247 INFO L87 Difference]: Start difference. First operand has 77 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 20:16:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:10,292 INFO L93 Difference]: Finished difference Result 147 states and 255 transitions. [2024-11-08 20:16:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:16:10,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2024-11-08 20:16:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:10,303 INFO L225 Difference]: With dead ends: 147 [2024-11-08 20:16:10,304 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 20:16:10,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:16:10,313 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:10,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:16:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 20:16:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 20:16:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 20:16:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-11-08 20:16:10,360 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 172 [2024-11-08 20:16:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:10,361 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-11-08 20:16:10,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 20:16:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-11-08 20:16:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 20:16:10,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:10,367 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:16:10,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:16:10,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:16:10,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:10,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1159594004, now seen corresponding path program 1 times [2024-11-08 20:16:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:16:10,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336820330] [2024-11-08 20:16:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:16:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:16:10,577 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:16:10,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:16:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:10,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:16:11,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:16:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:16:13,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:16:13,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:16:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336820330] [2024-11-08 20:16:13,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336820330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:13,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:13,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:16:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260524045] [2024-11-08 20:16:13,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:13,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:16:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:16:13,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:16:13,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:16:13,490 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:16:17,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:16:21,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:16:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:21,750 INFO L93 Difference]: Finished difference Result 214 states and 322 transitions. [2024-11-08 20:16:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:16:21,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-11-08 20:16:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:21,783 INFO L225 Difference]: With dead ends: 214 [2024-11-08 20:16:21,783 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 20:16:21,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:16:21,785 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 63 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:21,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 351 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-08 20:16:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 20:16:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2024-11-08 20:16:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 68 states have internal predecessors, (80), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 20:16:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2024-11-08 20:16:21,867 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 172 [2024-11-08 20:16:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:21,868 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2024-11-08 20:16:21,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:16:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2024-11-08 20:16:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 20:16:21,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:21,871 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:16:21,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 20:16:22,071 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-11-08 20:16:22,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:22,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash -529817048, now seen corresponding path program 1 times [2024-11-08 20:16:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:16:22,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097058830] [2024-11-08 20:16:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:22,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:16:22,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:16:22,078 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-11-08 20:16:22,079 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-11-08 20:16:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:22,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:16:22,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:16:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:16:22,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:16:22,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:16:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097058830] [2024-11-08 20:16:22,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097058830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:16:22,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:16:22,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:16:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417920725] [2024-11-08 20:16:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:22,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:16:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:16:22,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:16:22,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:16:22,510 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:16:23,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:16:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:23,909 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2024-11-08 20:16:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:16:23,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-11-08 20:16:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:23,913 INFO L225 Difference]: With dead ends: 226 [2024-11-08 20:16:23,913 INFO L226 Difference]: Without dead ends: 156 [2024-11-08 20:16:23,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 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-11-08 20:16:23,915 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 35 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:23,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 234 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 20:16:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-08 20:16:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2024-11-08 20:16:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 89 states have (on average 1.202247191011236) internal successors, (107), 90 states have internal predecessors, (107), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 20:16:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 227 transitions. [2024-11-08 20:16:23,940 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 227 transitions. Word has length 173 [2024-11-08 20:16:23,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:23,941 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 227 transitions. [2024-11-08 20:16:23,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:16:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 227 transitions. [2024-11-08 20:16:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 20:16:23,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:23,944 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:16:23,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 20:16:24,145 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-11-08 20:16:24,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:24,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1116623062, now seen corresponding path program 1 times [2024-11-08 20:16:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:16:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914720597] [2024-11-08 20:16:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:24,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:16:24,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:16:24,151 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-11-08 20:16:24,152 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-11-08 20:16:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:24,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:16:24,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:16:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 54 proven. 150 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 20:16:26,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:16:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 20:16:26,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:16:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914720597] [2024-11-08 20:16:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914720597] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 20:16:26,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 20:16:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-11-08 20:16:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660548081] [2024-11-08 20:16:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:16:26,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:16:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:16:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:16:26,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:16:26,846 INFO L87 Difference]: Start difference. First operand 153 states and 227 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:16:29,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:16:32,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:16:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:16:32,645 INFO L93 Difference]: Finished difference Result 286 states and 420 transitions. [2024-11-08 20:16:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:16:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-11-08 20:16:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:16:32,651 INFO L225 Difference]: With dead ends: 286 [2024-11-08 20:16:32,651 INFO L226 Difference]: Without dead ends: 188 [2024-11-08 20:16:32,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 20:16:32,653 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 25 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-08 20:16:32,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 283 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-08 20:16:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-08 20:16:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 158. [2024-11-08 20:16:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 94 states have (on average 1.202127659574468) internal successors, (113), 95 states have internal predecessors, (113), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 20:16:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2024-11-08 20:16:32,682 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 173 [2024-11-08 20:16:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:16:32,683 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2024-11-08 20:16:32,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 20:16:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2024-11-08 20:16:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 20:16:32,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:16:32,687 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:16:32,704 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 (5)] Ended with exit code 0 [2024-11-08 20:16:32,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:16:32,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:16:32,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:16:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash -415558484, now seen corresponding path program 1 times [2024-11-08 20:16:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:16:32,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221276914] [2024-11-08 20:16:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:16:32,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:16:32,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:16:32,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:16:32,892 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 (6)] Waiting until timeout for monitored process [2024-11-08 20:16:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:16:33,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 20:16:33,337 INFO L278 TraceCheckSpWp]: Computing forward predicates...