./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.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_loopvsstraightlinecode_100-1loop_file-37.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 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:19:00,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:19:00,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:19:00,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:19:00,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:19:00,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:19:00,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:19:00,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:19:00,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:19:00,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:19:00,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:19:00,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:19:00,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:19:00,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:19:00,766 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:19:00,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:19:00,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:19:00,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:19:00,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:19:00,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:19:00,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:19:00,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:19:00,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:19:00,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:19:00,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:19:00,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:19:00,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:19:00,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:19:00,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:19:00,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:19:00,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:19:00,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:19:00,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:19:00,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:19:00,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:19:00,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:19:00,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:19:00,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:19:00,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:19:00,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:19:00,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:19:00,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:19:00,776 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 -> 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 [2024-11-08 23:19:01,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:19:01,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:19:01,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:19:01,103 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:19:01,104 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:19:01,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-11-08 23:19:02,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:19:02,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:19:02,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-11-08 23:19:02,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ce53ad5/ce10cf4a0aee48d0991ec0b7027ab5de/FLAGda68aae88 [2024-11-08 23:19:03,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ce53ad5/ce10cf4a0aee48d0991ec0b7027ab5de [2024-11-08 23:19:03,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:19:03,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:19:03,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:19:03,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:19:03,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:19:03,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c445f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03, skipping insertion in model container [2024-11-08 23:19:03,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:19:03,291 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_loopvsstraightlinecode_100-1loop_file-37.i[916,929] [2024-11-08 23:19:03,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:19:03,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:19:03,403 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_loopvsstraightlinecode_100-1loop_file-37.i[916,929] [2024-11-08 23:19:03,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:19:03,487 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:19:03,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03 WrapperNode [2024-11-08 23:19:03,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:19:03,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:19:03,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:19:03,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:19:03,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,550 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-11-08 23:19:03,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:19:03,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:19:03,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:19:03,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:19:03,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,585 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 23:19:03,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:19:03,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:19:03,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:19:03,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:19:03,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (1/1) ... [2024-11-08 23:19:03,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:19:03,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:03,662 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 23:19:03,666 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 23:19:03,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:19:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:19:03,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:19:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:19:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:19:03,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:19:03,843 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:19:03,845 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:19:04,355 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-08 23:19:04,355 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:19:04,368 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:19:04,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:19:04,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:04 BoogieIcfgContainer [2024-11-08 23:19:04,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:19:04,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:19:04,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:19:04,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:19:04,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:19:03" (1/3) ... [2024-11-08 23:19:04,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c6071a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:04, skipping insertion in model container [2024-11-08 23:19:04,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:03" (2/3) ... [2024-11-08 23:19:04,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c6071a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:04, skipping insertion in model container [2024-11-08 23:19:04,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:04" (3/3) ... [2024-11-08 23:19:04,379 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-11-08 23:19:04,395 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:19:04,396 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:19:04,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:19:04,463 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;@77a436e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:19:04,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:19:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 72 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:19:04,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:19:04,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:04,478 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:19:04,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1725202752, now seen corresponding path program 1 times [2024-11-08 23:19:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:04,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246029864] [2024-11-08 23:19:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:19:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:19:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:19:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:19:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:19:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:19:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:19:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:19:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:19:04,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:04,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246029864] [2024-11-08 23:19:04,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246029864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:05,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:05,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:19:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624517955] [2024-11-08 23:19:05,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:05,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:19:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:05,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:19:05,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:19:05,036 INFO L87 Difference]: Start difference. First operand has 94 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 72 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:19:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:05,075 INFO L93 Difference]: Finished difference Result 185 states and 311 transitions. [2024-11-08 23:19:05,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:19:05,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2024-11-08 23:19:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:05,087 INFO L225 Difference]: With dead ends: 185 [2024-11-08 23:19:05,088 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 23:19:05,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 23:19:05,097 INFO L432 NwaCegarLoop]: 144 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, 144 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 23:19:05,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:19:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 23:19:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 23:19:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:19:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2024-11-08 23:19:05,146 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 137 [2024-11-08 23:19:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:05,147 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2024-11-08 23:19:05,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:19:05,147 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2024-11-08 23:19:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:19:05,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:05,150 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:19:05,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:19:05,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:05,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 940810492, now seen corresponding path program 1 times [2024-11-08 23:19:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514275560] [2024-11-08 23:19:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:05,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:19:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:19:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:19:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:19:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:19:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:19:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:19:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:19:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:19:05,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514275560] [2024-11-08 23:19:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514275560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:05,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:19:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672227796] [2024-11-08 23:19:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:05,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:19:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:19:05,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:19:05,507 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:19:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:05,595 INFO L93 Difference]: Finished difference Result 261 states and 408 transitions. [2024-11-08 23:19:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:19:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-08 23:19:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:05,599 INFO L225 Difference]: With dead ends: 261 [2024-11-08 23:19:05,599 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 23:19:05,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 23:19:05,601 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 125 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:05,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 298 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:19:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 23:19:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2024-11-08 23:19:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 23:19:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2024-11-08 23:19:05,644 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 137 [2024-11-08 23:19:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:05,645 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2024-11-08 23:19:05,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:19:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2024-11-08 23:19:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 23:19:05,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:05,650 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:19:05,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:19:05,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:05,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1100509779, now seen corresponding path program 1 times [2024-11-08 23:19:05,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:05,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336982773] [2024-11-08 23:19:05,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:05,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:19:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:19:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:19:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:19:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:19:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:19:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:19:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:19:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:19:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:06,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336982773] [2024-11-08 23:19:06,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336982773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:06,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:06,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:19:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505444374] [2024-11-08 23:19:06,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:06,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:19:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:06,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:19:06,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:19:06,187 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:19:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:06,493 INFO L93 Difference]: Finished difference Result 399 states and 608 transitions. [2024-11-08 23:19:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:19:06,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-08 23:19:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:06,500 INFO L225 Difference]: With dead ends: 399 [2024-11-08 23:19:06,501 INFO L226 Difference]: Without dead ends: 230 [2024-11-08 23:19:06,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:19:06,503 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 192 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:06,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 724 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:19:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-08 23:19:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2024-11-08 23:19:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 177 states have internal predecessors, (247), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 23:19:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 335 transitions. [2024-11-08 23:19:06,544 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 335 transitions. Word has length 138 [2024-11-08 23:19:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:06,544 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 335 transitions. [2024-11-08 23:19:06,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:19:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 335 transitions. [2024-11-08 23:19:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 23:19:06,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:06,547 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:19:06,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:19:06,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:06,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:06,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1340345743, now seen corresponding path program 1 times [2024-11-08 23:19:06,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:06,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774440188] [2024-11-08 23:19:06,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:06,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:19:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:19:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:19:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:19:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:19:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:19:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:19:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:19:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:19:06,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:06,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774440188] [2024-11-08 23:19:06,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774440188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:06,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:06,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:19:06,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279606154] [2024-11-08 23:19:06,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:06,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:19:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:06,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:19:06,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:19:06,986 INFO L87 Difference]: Start difference. First operand 225 states and 335 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:19:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:07,327 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2024-11-08 23:19:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:19:07,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-11-08 23:19:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:07,334 INFO L225 Difference]: With dead ends: 455 [2024-11-08 23:19:07,334 INFO L226 Difference]: Without dead ends: 233 [2024-11-08 23:19:07,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:19:07,336 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 167 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:07,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 594 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:19:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-08 23:19:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2024-11-08 23:19:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 179 states have (on average 1.3910614525139664) internal successors, (249), 180 states have internal predecessors, (249), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 23:19:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 337 transitions. [2024-11-08 23:19:07,359 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 337 transitions. Word has length 139 [2024-11-08 23:19:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:07,360 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 337 transitions. [2024-11-08 23:19:07,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:19:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 337 transitions. [2024-11-08 23:19:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 23:19:07,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:07,362 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:19:07,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:19:07,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:07,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1458310040, now seen corresponding path program 1 times [2024-11-08 23:19:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:07,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810897912] [2024-11-08 23:19:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:19:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:19:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:19:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:19:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:19:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:19:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:19:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:19:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 23:19:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:08,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810897912] [2024-11-08 23:19:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810897912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:19:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936715282] [2024-11-08 23:19:08,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:08,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:08,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:08,122 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 23:19:08,123 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 23:19:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:08,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:19:08,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 393 proven. 24 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-08 23:19:08,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:19:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 23:19:08,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936715282] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:19:08,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:19:08,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 23:19:08,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354475079] [2024-11-08 23:19:08,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:19:08,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:19:08,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:08,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:19:08,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:19:08,747 INFO L87 Difference]: Start difference. First operand 229 states and 337 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 23:19:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:09,069 INFO L93 Difference]: Finished difference Result 375 states and 548 transitions. [2024-11-08 23:19:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:19:09,069 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 140 [2024-11-08 23:19:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:09,071 INFO L225 Difference]: With dead ends: 375 [2024-11-08 23:19:09,071 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 23:19:09,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:19:09,073 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 411 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:09,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 246 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:19:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 23:19:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2024-11-08 23:19:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.31) internal successors, (131), 101 states have internal predecessors, (131), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:19:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2024-11-08 23:19:09,090 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 140 [2024-11-08 23:19:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:09,090 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2024-11-08 23:19:09,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 23:19:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2024-11-08 23:19:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:19:09,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:09,092 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:19:09,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:19:09,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:09,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:09,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:09,294 INFO L85 PathProgramCache]: Analyzing trace with hash 998679790, now seen corresponding path program 1 times [2024-11-08 23:19:09,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:09,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788314121] [2024-11-08 23:19:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:09,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:19:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [12761013] [2024-11-08 23:19:09,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:09,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:09,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:09,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:09,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:19:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:09,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 23:19:09,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 402 proven. 78 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 23:19:10,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:19:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-08 23:19:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788314121] [2024-11-08 23:19:13,121 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:19:13,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12761013] [2024-11-08 23:19:13,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12761013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:19:13,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:19:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2024-11-08 23:19:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606158024] [2024-11-08 23:19:13,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:19:13,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 23:19:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 23:19:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-11-08 23:19:13,124 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand has 28 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 28 states have internal predecessors, (96), 8 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-08 23:19:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:19,268 INFO L93 Difference]: Finished difference Result 710 states and 962 transitions. [2024-11-08 23:19:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-08 23:19:19,269 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 28 states have internal predecessors, (96), 8 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) Word has length 141 [2024-11-08 23:19:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:19,274 INFO L225 Difference]: With dead ends: 710 [2024-11-08 23:19:19,275 INFO L226 Difference]: Without dead ends: 584 [2024-11-08 23:19:19,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1495, Invalid=4511, Unknown=0, NotChecked=0, Total=6006 [2024-11-08 23:19:19,279 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 2459 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:19,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 897 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 23:19:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-08 23:19:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 395. [2024-11-08 23:19:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 311 states have (on average 1.2990353697749195) internal successors, (404), 313 states have internal predecessors, (404), 66 states have call successors, (66), 17 states have call predecessors, (66), 17 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 23:19:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 536 transitions. [2024-11-08 23:19:19,375 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 536 transitions. Word has length 141 [2024-11-08 23:19:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:19,376 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 536 transitions. [2024-11-08 23:19:19,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 28 states have internal predecessors, (96), 8 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-08 23:19:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 536 transitions. [2024-11-08 23:19:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:19:19,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:19,380 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:19:19,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:19:19,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 23:19:19,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:19,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:19,582 INFO L85 PathProgramCache]: Analyzing trace with hash -12437460, now seen corresponding path program 1 times [2024-11-08 23:19:19,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:19,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053052179] [2024-11-08 23:19:19,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:19,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:19:19,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587393289] [2024-11-08 23:19:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:19,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:19,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:19,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:19,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:19:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:19,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 23:19:19,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 500 proven. 87 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-08 23:19:21,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:19:28,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:28,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053052179] [2024-11-08 23:19:28,856 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:19:28,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587393289] [2024-11-08 23:19:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587393289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:19:28,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:19:28,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-08 23:19:28,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304893114] [2024-11-08 23:19:28,857 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 23:19:28,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 23:19:28,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:28,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 23:19:28,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=340, Unknown=1, NotChecked=0, Total=420 [2024-11-08 23:19:28,858 INFO L87 Difference]: Start difference. First operand 395 states and 536 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 23:19:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:30,231 INFO L93 Difference]: Finished difference Result 683 states and 917 transitions. [2024-11-08 23:19:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 23:19:30,232 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 141 [2024-11-08 23:19:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:30,235 INFO L225 Difference]: With dead ends: 683 [2024-11-08 23:19:30,235 INFO L226 Difference]: Without dead ends: 430 [2024-11-08 23:19:30,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=303, Invalid=1102, Unknown=1, NotChecked=0, Total=1406 [2024-11-08 23:19:30,237 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 319 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:30,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 844 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 23:19:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-08 23:19:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 403. [2024-11-08 23:19:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 317 states have (on average 1.2902208201892744) internal successors, (409), 319 states have internal predecessors, (409), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 23:19:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 541 transitions. [2024-11-08 23:19:30,315 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 541 transitions. Word has length 141 [2024-11-08 23:19:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:30,316 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 541 transitions. [2024-11-08 23:19:30,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 23:19:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 541 transitions. [2024-11-08 23:19:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:19:30,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:30,318 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:19:30,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:19:30,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:30,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:30,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1139228400, now seen corresponding path program 1 times [2024-11-08 23:19:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:30,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660740442] [2024-11-08 23:19:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:19:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921651399] [2024-11-08 23:19:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:30,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:30,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:30,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:30,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 23:19:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 23:19:30,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 523 proven. 114 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-08 23:19:32,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:19:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660740442] [2024-11-08 23:19:48,661 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:19:48,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921651399] [2024-11-08 23:19:48,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921651399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:19:48,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:19:48,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2024-11-08 23:19:48,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911010917] [2024-11-08 23:19:48,661 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 23:19:48,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 23:19:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:48,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 23:19:48,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=518, Unknown=8, NotChecked=0, Total=702 [2024-11-08 23:19:48,663 INFO L87 Difference]: Start difference. First operand 403 states and 541 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 states have internal predecessors, (68), 8 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 8 states have call successors, (20) [2024-11-08 23:19:49,631 WARN L873 $PredicateComparison]: unable to prove that (and (<= c_~var_1_5~0 63) (<= c_~var_1_4~0 127) (<= 63 c_~var_1_4~0) (<= c_~var_1_3~0 127) (or (< 0 (div c_~var_1_5~0 c_~var_1_4~0)) (exists ((~var_1_23~0 Int)) (and (not (= ~var_1_23~0 0)) (<= 1 (div c_~var_1_5~0 ~var_1_23~0))))) (not (= c_~var_1_23~0 0)) (<= 0 c_~var_1_5~0)) is different from true [2024-11-08 23:19:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:51,432 INFO L93 Difference]: Finished difference Result 942 states and 1257 transitions. [2024-11-08 23:19:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 23:19:51,433 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 states have internal predecessors, (68), 8 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 8 states have call successors, (20) Word has length 141 [2024-11-08 23:19:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:51,437 INFO L225 Difference]: With dead ends: 942 [2024-11-08 23:19:51,437 INFO L226 Difference]: Without dead ends: 764 [2024-11-08 23:19:51,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=332, Invalid=921, Unknown=11, NotChecked=68, Total=1332 [2024-11-08 23:19:51,439 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 322 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 48 mSolverCounterUnsat, 120 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 120 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:51,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 605 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 850 Invalid, 120 Unknown, 37 Unchecked, 1.9s Time] [2024-11-08 23:19:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-11-08 23:19:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 551. [2024-11-08 23:19:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 451 states have (on average 1.3015521064301552) internal successors, (587), 454 states have internal predecessors, (587), 70 states have call successors, (70), 29 states have call predecessors, (70), 29 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 23:19:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 727 transitions. [2024-11-08 23:19:51,535 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 727 transitions. Word has length 141 [2024-11-08 23:19:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:51,535 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 727 transitions. [2024-11-08 23:19:51,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 states have internal predecessors, (68), 8 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 8 states have call successors, (20) [2024-11-08 23:19:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 727 transitions. [2024-11-08 23:19:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:19:51,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:51,537 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:19:51,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 23:19:51,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:51,742 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:51,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 128111150, now seen corresponding path program 1 times [2024-11-08 23:19:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718794421] [2024-11-08 23:19:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:19:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336554870] [2024-11-08 23:19:52,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:52,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:52,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:52,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:52,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 23:19:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:52,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 23:19:52,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 502 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:19:53,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:20:01,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~last_1_var_1_10~0 65536))) (let ((.cse2 (div c_~var_1_5~0 c_~var_1_4~0)) (.cse0 (+ .cse3 1))) (let ((.cse4 (= (mod c_~var_1_5~0 c_~var_1_4~0) 0)) (.cse5 (< .cse2 .cse0)) (.cse1 (< 0 (+ c_~var_1_5~0 1)))) (and (forall ((~var_1_23~0 Int)) (or (< (div c_~var_1_5~0 ~var_1_23~0) .cse0) (not (= (mod c_~var_1_5~0 ~var_1_23~0) 0)) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0))) (or .cse1 (and (or (< c_~var_1_4~0 0) (< .cse2 .cse3)) (<= .cse2 .cse0)) .cse4) (or (not .cse4) .cse5) (or (< c_~var_1_5~0 0) .cse5) (or (forall ((~var_1_23~0 Int)) (or (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (= (mod c_~var_1_5~0 ~var_1_23~0) 0) (< (div c_~var_1_5~0 ~var_1_23~0) (+ 2 .cse3)))) .cse1) (forall ((~var_1_23~0 Int)) (or (< (div c_~var_1_5~0 ~var_1_23~0) .cse0) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (< ~var_1_23~0 0))))))) is different from false [2024-11-08 23:20:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:20:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718794421] [2024-11-08 23:20:01,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:20:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336554870] [2024-11-08 23:20:01,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336554870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:20:01,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:20:01,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-08 23:20:01,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009222729] [2024-11-08 23:20:01,288 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 23:20:01,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 23:20:01,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:20:01,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 23:20:01,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=264, Unknown=1, NotChecked=34, Total=380 [2024-11-08 23:20:01,290 INFO L87 Difference]: Start difference. First operand 551 states and 727 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 23:20:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:20:02,995 INFO L93 Difference]: Finished difference Result 818 states and 1078 transitions. [2024-11-08 23:20:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 23:20:02,996 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 141 [2024-11-08 23:20:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:20:03,003 INFO L225 Difference]: With dead ends: 818 [2024-11-08 23:20:03,003 INFO L226 Difference]: Without dead ends: 566 [2024-11-08 23:20:03,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=310, Invalid=953, Unknown=1, NotChecked=68, Total=1332 [2024-11-08 23:20:03,005 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 167 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:20:03,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 592 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 23:20:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-08 23:20:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 531. [2024-11-08 23:20:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 431 states have (on average 1.2900232018561484) internal successors, (556), 434 states have internal predecessors, (556), 70 states have call successors, (70), 29 states have call predecessors, (70), 29 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 23:20:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 696 transitions. [2024-11-08 23:20:03,097 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 696 transitions. Word has length 141 [2024-11-08 23:20:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:20:03,098 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 696 transitions. [2024-11-08 23:20:03,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 23:20:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 696 transitions. [2024-11-08 23:20:03,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:20:03,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:03,100 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:20:03,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 23:20:03,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:20:03,302 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:03,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:03,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1894873305, now seen corresponding path program 1 times [2024-11-08 23:20:03,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:20:03,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979982120] [2024-11-08 23:20:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:20:03,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447211146] [2024-11-08 23:20:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:03,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:20:03,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:20:03,486 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:20:03,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 23:20:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:20:03,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:20:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:20:03,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:20:03,782 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:20:03,783 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:20:03,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 23:20:03,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:20:03,989 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:04,126 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:20:04,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:20:04 BoogieIcfgContainer [2024-11-08 23:20:04,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:20:04,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:20:04,130 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:20:04,130 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:20:04,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:04" (3/4) ... [2024-11-08 23:20:04,133 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:20:04,134 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:20:04,134 INFO L158 Benchmark]: Toolchain (without parser) took 61056.25ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 131.8MB in the beginning and 264.8MB in the end (delta: -133.0MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2024-11-08 23:20:04,134 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:20:04,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.76ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 113.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:20:04,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.60ms. Allocated memory is still 163.6MB. Free memory was 113.7MB in the beginning and 109.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:20:04,135 INFO L158 Benchmark]: Boogie Preprocessor took 68.50ms. Allocated memory is still 163.6MB. Free memory was 109.5MB in the beginning and 103.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:20:04,135 INFO L158 Benchmark]: RCFGBuilder took 748.15ms. Allocated memory is still 163.6MB. Free memory was 103.8MB in the beginning and 108.8MB in the end (delta: -5.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:20:04,136 INFO L158 Benchmark]: TraceAbstraction took 59758.54ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 108.2MB in the beginning and 264.8MB in the end (delta: -156.6MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2024-11-08 23:20:04,136 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 356.5MB. Free memory is still 264.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:20:04,138 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.22ms. Allocated memory is still 109.1MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.76ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 113.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.60ms. Allocated memory is still 163.6MB. Free memory was 113.7MB in the beginning and 109.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.50ms. Allocated memory is still 163.6MB. Free memory was 109.5MB in the beginning and 103.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 748.15ms. Allocated memory is still 163.6MB. Free memory was 103.8MB in the beginning and 108.8MB in the end (delta: -5.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 59758.54ms. Allocated memory was 163.6MB in the beginning and 356.5MB in the end (delta: 192.9MB). Free memory was 108.2MB in the beginning and 264.8MB in the end (delta: -156.6MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 356.5MB. Free memory is still 264.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryArithmeticFLOAToperation at line 75, overapproximation of someUnaryFLOAToperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 2; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 10; [L25] signed char var_1_4 = 64; [L26] signed char var_1_5 = 5; [L27] double var_1_7 = 4.175; [L28] unsigned char var_1_9 = 100; [L29] unsigned short int var_1_10 = 128; [L30] float var_1_11 = 10.6; [L31] float var_1_12 = 16.25; [L32] float var_1_13 = 0.0; [L33] float var_1_14 = 127.2; [L34] double var_1_15 = 0.75; [L35] unsigned char var_1_18 = 1; [L36] unsigned char var_1_19 = 1; [L37] signed char var_1_20 = 1; [L38] signed short int var_1_21 = -1; [L39] unsigned long int var_1_22 = 1000000000; [L40] signed long int var_1_23 = -50; [L41] unsigned long int var_1_24 = 3900988395; [L42] unsigned long int var_1_25 = 2230016845; [L43] unsigned long int var_1_26 = 256; [L44] unsigned long int var_1_27 = 4; [L45] signed char var_1_29 = 8; [L46] signed long int last_1_var_1_1 = 2; [L47] unsigned char last_1_var_1_9 = 100; [L48] unsigned short int last_1_var_1_10 = 128; [L49] double last_1_var_1_15 = 0.75; [L50] signed short int last_1_var_1_21 = -1; [L51] unsigned long int last_1_var_1_22 = 1000000000; [L52] unsigned long int last_1_var_1_27 = 4; [L53] signed char last_1_var_1_29 = 8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=0, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L187] isInitial = 1 [L188] FCALL initially() [L189] int k_loop; [L190] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=0, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L190] COND TRUE k_loop < 1 [L191] CALL updateLastVariables() [L173] last_1_var_1_1 = var_1_1 [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_10 = var_1_10 [L176] last_1_var_1_15 = var_1_15 [L177] last_1_var_1_21 = var_1_21 [L178] last_1_var_1_22 = var_1_22 [L179] last_1_var_1_27 = var_1_27 [L180] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=0, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L191] RET updateLastVariables() [L192] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L143] var_1_3 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_3 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L144] RET assume_abort_if_not(var_1_3 >= -1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L147] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L149] var_1_5 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L152] var_1_12 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L153] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L154] var_1_13 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L155] RET assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L156] var_1_14 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L157] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L158] var_1_19 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L159] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L161] var_1_23 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L162] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L165] var_1_24 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_24 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L166] RET assume_abort_if_not(var_1_24 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] CALL assume_abort_if_not(var_1_24 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] RET assume_abort_if_not(var_1_24 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L168] var_1_25 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_25 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L169] RET assume_abort_if_not(var_1_25 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L192] RET updateVariables() [L193] CALL step() [L57] signed long int stepLocal_3 = last_1_var_1_1 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_3=16, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L58] COND TRUE var_1_5 == stepLocal_3 [L59] var_1_21 = ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L63] signed long int stepLocal_4 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_4=128, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L64] COND TRUE (var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= stepLocal_4 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L65] COND TRUE \read(var_1_19) [L66] var_1_22 = (var_1_24 - (last_1_var_1_9 + var_1_4)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L71] COND TRUE last_1_var_1_15 < (- var_1_14) [L72] var_1_18 = (var_1_2 || var_1_19) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L74] var_1_10 = ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4))) [L75] var_1_11 = (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13)))) [L76] var_1_20 = var_1_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L77] COND TRUE var_1_21 != 10 [L78] var_1_9 = ((((var_1_4) > (2)) ? (var_1_4) : (2))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L90] signed short int stepLocal_2 = var_1_21; [L91] unsigned long int stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, stepLocal_2=-13699, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L92] COND FALSE !((var_1_9 * (var_1_4 * var_1_5)) < stepLocal_2) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L99] COND TRUE \read(var_1_18) [L100] var_1_15 = ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L112] signed long int stepLocal_0 = 500 * var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L113] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L114] COND FALSE !((var_1_3 - (var_1_4 - var_1_5)) >= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L120] COND TRUE var_1_18 && var_1_19 [L121] var_1_27 = ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=256, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L123] COND TRUE (var_1_13 - var_1_14) <= var_1_12 [L124] var_1_26 = (var_1_25 - var_1_27) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L128] unsigned char stepLocal_5 = var_1_13 < var_1_15; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, stepLocal_5=1, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L129] COND TRUE var_1_18 || stepLocal_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L130] COND TRUE (((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15 [L131] var_1_29 = (var_1_5 - 10) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L193] RET step() [L194] CALL, EXPR property() [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L183] EXPR ((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L183-L184] return ((((((((((((var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1)) && ((var_1_21 != 10) ? (var_1_9 == ((unsigned char) ((((var_1_4) > (2)) ? (var_1_4) : (2))))) : ((var_1_22 > (var_1_21 / 128)) ? (var_1_18 ? (var_1_9 == ((unsigned char) var_1_4)) : (var_1_9 == ((unsigned char) var_1_5))) : (var_1_9 == ((unsigned char) var_1_4))))) && (var_1_10 == ((unsigned short int) ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4)))))) && (var_1_11 == ((float) (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13))))))) && (var_1_18 ? (var_1_15 == ((double) ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : ((var_1_22 < var_1_4) ? ((var_1_18 || var_1_18) ? (var_1_15 == ((double) var_1_14)) : (var_1_15 == ((double) var_1_14))) : (var_1_15 == ((double) var_1_13))))) && ((last_1_var_1_15 < (- var_1_14)) ? (var_1_18 == ((unsigned char) (var_1_2 || var_1_19))) : 1)) && (var_1_20 == ((signed char) var_1_5))) && ((var_1_5 == (last_1_var_1_1 * last_1_var_1_29)) ? (var_1_21 == ((signed short int) ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))))) : (var_1_21 == ((signed short int) ((((last_1_var_1_21) > (var_1_4)) ? (last_1_var_1_21) : (var_1_4))))))) && (((var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= last_1_var_1_10) ? (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_24 - (last_1_var_1_9 + var_1_4)))) : (var_1_22 == ((unsigned long int) (((((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) < (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))) ? ((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) : (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))))))) : 1)) && (((var_1_13 - var_1_14) <= var_1_12) ? (var_1_26 == ((unsigned long int) (var_1_25 - var_1_27))) : (var_1_26 == ((unsigned long int) ((((var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) < 0 ) ? -(var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) : (var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))))))))) && ((var_1_18 && var_1_19) ? (var_1_27 == ((unsigned long int) ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))))) : 1)) && ((var_1_18 || (var_1_13 < var_1_15)) ? (((((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15) ? (var_1_29 == ((signed char) (var_1_5 - 10))) : (var_1_29 == ((signed char) var_1_5))) : (var_1_29 == ((signed char) var_1_5))) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=127, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.6s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 120 mSolverCounterUnknown, 4174 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4162 mSDsluCounter, 4944 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 3779 mSDsCounter, 888 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4898 IncrementalHoareTripleChecker+Invalid, 5943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 888 mSolverCounterUnsat, 1165 mSDtfsCounter, 4898 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1487 GetRequests, 1278 SyntacticMatches, 1 SemanticMatches, 208 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2891 ImplicationChecksByTransitivity, 30.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=8, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 495 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 41.6s InterpolantComputationTime, 2243 NumberOfCodeBlocks, 2243 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1664 ConstructedInterpolants, 9 QuantifiedInterpolants, 10445 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1835 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 8574/9120 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 23:20:04,355 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-08 23:20:04,406 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 137 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_loopvsstraightlinecode_100-1loop_file-37.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 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:20:06,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:20:06,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:20:06,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:20:06,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:20:06,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:20:06,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:20:06,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:20:06,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:20:06,506 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:20:06,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:20:06,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:20:06,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:20:06,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:20:06,509 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:20:06,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:20:06,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:20:06,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:20:06,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:20:06,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:20:06,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:20:06,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:20:06,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:20:06,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:20:06,515 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:20:06,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:20:06,515 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:20:06,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:20:06,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:20:06,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:20:06,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:20:06,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:20:06,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:20:06,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:20:06,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:20:06,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:20:06,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:20:06,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:20:06,518 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:20:06,518 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:20:06,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:20:06,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:20:06,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:20:06,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:20:06,521 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 -> 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 [2024-11-08 23:20:06,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:20:06,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:20:06,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:20:06,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:20:06,885 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:20:06,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-11-08 23:20:08,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:20:08,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:20:08,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-11-08 23:20:08,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c08e8a8/3d6c9a65664845bb962fb656110bbbdf/FLAG426711d4f [2024-11-08 23:20:09,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c08e8a8/3d6c9a65664845bb962fb656110bbbdf [2024-11-08 23:20:09,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:20:09,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:20:09,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:20:09,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:20:09,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:20:09,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1022c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09, skipping insertion in model container [2024-11-08 23:20:09,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:20:09,403 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_loopvsstraightlinecode_100-1loop_file-37.i[916,929] [2024-11-08 23:20:09,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:20:09,528 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:20:09,543 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_loopvsstraightlinecode_100-1loop_file-37.i[916,929] [2024-11-08 23:20:09,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:20:09,618 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:20:09,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09 WrapperNode [2024-11-08 23:20:09,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:20:09,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:20:09,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:20:09,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:20:09,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,690 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-08 23:20:09,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:20:09,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:20:09,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:20:09,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:20:09,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,743 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 23:20:09,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:20:09,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:20:09,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:20:09,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:20:09,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (1/1) ... [2024-11-08 23:20:09,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:20:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:20:09,828 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 23:20:09,834 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 23:20:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:20:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:20:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:20:09,868 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:20:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:20:09,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:20:09,954 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:20:09,956 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:20:24,086 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 23:20:24,086 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:20:24,107 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:20:24,107 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:20:24,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:20:24 BoogieIcfgContainer [2024-11-08 23:20:24,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:20:24,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:20:24,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:20:24,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:20:24,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:20:09" (1/3) ... [2024-11-08 23:20:24,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c012d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:20:24, skipping insertion in model container [2024-11-08 23:20:24,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:09" (2/3) ... [2024-11-08 23:20:24,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c012d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:20:24, skipping insertion in model container [2024-11-08 23:20:24,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:20:24" (3/3) ... [2024-11-08 23:20:24,115 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-37.i [2024-11-08 23:20:24,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:20:24,132 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:20:24,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:20:24,209 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;@780eab31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:20:24,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:20:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:20:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 23:20:24,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:24,229 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:20:24,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:24,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1606444708, now seen corresponding path program 1 times [2024-11-08 23:20:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:20:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371834833] [2024-11-08 23:20:24,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:24,248 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 23:20:24,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:20:24,251 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 23:20:24,269 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