./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_25-while_file-33.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 4d07f6d4eb00f77dbf0a6f761a1dfb43bb3a584f994c1eafe03cf0135e1262b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:38:08,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:38:08,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:38:08,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:38:08,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:38:08,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:38:08,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:38:08,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:38:08,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:38:08,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:38:08,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:38:08,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:38:08,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:38:08,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:38:08,626 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:38:08,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:38:08,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:38:08,626 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:38:08,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:38:08,627 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:38:08,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:38:08,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:38:08,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:38:08,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:38:08,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:38:08,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:38:08,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:38:08,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:38:08,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:38:08,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:38:08,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:38:08,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:38:08,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 4d07f6d4eb00f77dbf0a6f761a1dfb43bb3a584f994c1eafe03cf0135e1262b3 [2025-03-17 03:38:08,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:38:08,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:38:08,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:38:08,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:38:08,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:38:08,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2025-03-17 03:38:10,098 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5304ae48/b17a16517ac045febfa58007c1ee24c9/FLAG644d35719 [2025-03-17 03:38:10,326 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:38:10,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2025-03-17 03:38:10,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5304ae48/b17a16517ac045febfa58007c1ee24c9/FLAG644d35719 [2025-03-17 03:38:10,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5304ae48/b17a16517ac045febfa58007c1ee24c9 [2025-03-17 03:38:10,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:38:10,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:38:10,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:38:10,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:38:10,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:38:10,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c442006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10, skipping insertion in model container [2025-03-17 03:38:10,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:38:10,453 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_25-while_file-33.i[915,928] [2025-03-17 03:38:10,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:38:10,496 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:38:10,503 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_25-while_file-33.i[915,928] [2025-03-17 03:38:10,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:38:10,524 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:38:10,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10 WrapperNode [2025-03-17 03:38:10,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:38:10,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:38:10,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:38:10,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:38:10,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,552 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-17 03:38:10,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:38:10,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:38:10,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:38:10,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:38:10,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,581 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]. [2025-03-17 03:38:10,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:38:10,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:38:10,599 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:38:10,599 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:38:10,600 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (1/1) ... [2025-03-17 03:38:10,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:38:10,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:38:10,629 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) [2025-03-17 03:38:10,631 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 [2025-03-17 03:38:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:38:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:38:10,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:38:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:38:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:38:10,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:38:10,708 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:38:10,710 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:38:10,903 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: havoc property_#t~bitwise10#1; [2025-03-17 03:38:10,923 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:38:10,923 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:38:10,935 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:38:10,936 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:38:10,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:38:10 BoogieIcfgContainer [2025-03-17 03:38:10,936 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:38:10,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:38:10,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:38:10,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:38:10,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:38:10" (1/3) ... [2025-03-17 03:38:10,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e704f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:38:10, skipping insertion in model container [2025-03-17 03:38:10,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:10" (2/3) ... [2025-03-17 03:38:10,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e704f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:38:10, skipping insertion in model container [2025-03-17 03:38:10,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:38:10" (3/3) ... [2025-03-17 03:38:10,943 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-33.i [2025-03-17 03:38:10,954 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:38:10,955 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-33.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:38:10,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:38:10,999 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;@3d33bcc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:38:10,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:38:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 03:38:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 03:38:11,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:11,010 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:11,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash 76067274, now seen corresponding path program 1 times [2025-03-17 03:38:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:38:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748762944] [2025-03-17 03:38:11,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:11,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:38:11,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 03:38:11,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 03:38:11,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 03:38:11,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:38:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748762944] [2025-03-17 03:38:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748762944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:38:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544295350] [2025-03-17 03:38:11,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:11,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:38:11,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:38:11,200 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) [2025-03-17 03:38:11,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:38:11,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 03:38:11,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 03:38:11,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:11,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:11,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:38:11,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:38:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 03:38:11,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:38:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544295350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:38:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:38:11,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395765507] [2025-03-17 03:38:11,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:11,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:38:11,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:38:11,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:38:11,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:38:11,340 INFO L87 Difference]: Start difference. First operand has 46 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 03:38:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:11,356 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2025-03-17 03:38:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:38:11,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2025-03-17 03:38:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:11,361 INFO L225 Difference]: With dead ends: 87 [2025-03-17 03:38:11,361 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 03:38:11,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:38:11,365 INFO L435 NwaCegarLoop]: 58 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, 58 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 [2025-03-17 03:38:11,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:38:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 03:38:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-17 03:38:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 03:38:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-17 03:38:11,391 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 62 [2025-03-17 03:38:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:11,391 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-17 03:38:11,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 03:38:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-17 03:38:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 03:38:11,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:11,393 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:11,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:38:11,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:38:11,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:11,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:11,594 INFO L85 PathProgramCache]: Analyzing trace with hash -634934680, now seen corresponding path program 1 times [2025-03-17 03:38:11,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:38:11,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274396427] [2025-03-17 03:38:11,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:38:11,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 03:38:11,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 03:38:11,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:11,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 03:38:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:38:11,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274396427] [2025-03-17 03:38:11,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274396427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:11,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:11,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:38:11,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801119211] [2025-03-17 03:38:11,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:11,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:38:11,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:38:11,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:38:11,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:38:11,787 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:11,888 INFO L93 Difference]: Finished difference Result 135 states and 185 transitions. [2025-03-17 03:38:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:38:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 62 [2025-03-17 03:38:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:11,890 INFO L225 Difference]: With dead ends: 135 [2025-03-17 03:38:11,890 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 03:38:11,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:38:11,891 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 77 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:11,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 149 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:38:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 03:38:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2025-03-17 03:38:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 65 states have internal predecessors, (81), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:38:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2025-03-17 03:38:11,908 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 62 [2025-03-17 03:38:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:11,908 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2025-03-17 03:38:11,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2025-03-17 03:38:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 03:38:11,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:11,909 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:11,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:38:11,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:11,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1832355634, now seen corresponding path program 1 times [2025-03-17 03:38:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:38:11,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748728484] [2025-03-17 03:38:11,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:38:11,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 03:38:11,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 03:38:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 03:38:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:38:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748728484] [2025-03-17 03:38:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748728484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:12,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:12,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:38:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514715672] [2025-03-17 03:38:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:12,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:38:12,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:38:12,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:38:12,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:38:12,089 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:12,212 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2025-03-17 03:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:38:12,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2025-03-17 03:38:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:12,214 INFO L225 Difference]: With dead ends: 177 [2025-03-17 03:38:12,215 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 03:38:12,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:38:12,216 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 72 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:12,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 221 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:38:12,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 03:38:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2025-03-17 03:38:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 65 states have internal predecessors, (80), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:38:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2025-03-17 03:38:12,229 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 66 [2025-03-17 03:38:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:12,230 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2025-03-17 03:38:12,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2025-03-17 03:38:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 03:38:12,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:12,231 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:12,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:38:12,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:12,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash -324803825, now seen corresponding path program 1 times [2025-03-17 03:38:12,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:38:12,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139539466] [2025-03-17 03:38:12,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:12,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:38:12,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 03:38:12,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 03:38:12,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:12,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 03:38:12,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:38:12,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139539466] [2025-03-17 03:38:12,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139539466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:12,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:12,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:38:12,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26526003] [2025-03-17 03:38:12,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:12,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:38:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:38:12,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:38:12,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:38:12,880 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:13,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:13,083 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2025-03-17 03:38:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:38:13,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2025-03-17 03:38:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:13,085 INFO L225 Difference]: With dead ends: 218 [2025-03-17 03:38:13,085 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 03:38:13,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:38:13,086 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:13,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:38:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 03:38:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2025-03-17 03:38:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.180722891566265) internal successors, (98), 83 states have internal predecessors, (98), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:38:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2025-03-17 03:38:13,106 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 66 [2025-03-17 03:38:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:13,107 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2025-03-17 03:38:13,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2025-03-17 03:38:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 03:38:13,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:13,110 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:13,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:38:13,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2121755184, now seen corresponding path program 1 times [2025-03-17 03:38:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:38:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911094777] [2025-03-17 03:38:13,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:38:13,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 03:38:13,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 03:38:13,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:13,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 03:38:15,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:38:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911094777] [2025-03-17 03:38:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911094777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:15,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:15,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:38:15,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150071462] [2025-03-17 03:38:15,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:15,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:38:15,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:38:15,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:38:15,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:38:15,089 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:16,018 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2025-03-17 03:38:16,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 03:38:16,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2025-03-17 03:38:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:16,020 INFO L225 Difference]: With dead ends: 158 [2025-03-17 03:38:16,020 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 03:38:16,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:38:16,021 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 256 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:16,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 270 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:38:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 03:38:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 120. [2025-03-17 03:38:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 92 states have (on average 1.173913043478261) internal successors, (108), 92 states have internal predecessors, (108), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:38:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2025-03-17 03:38:16,038 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 156 transitions. Word has length 66 [2025-03-17 03:38:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:16,039 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 156 transitions. [2025-03-17 03:38:16,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 156 transitions. [2025-03-17 03:38:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 03:38:16,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:16,040 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:16,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:38:16,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:16,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:16,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1340545803, now seen corresponding path program 1 times [2025-03-17 03:38:16,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:38:16,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531744520] [2025-03-17 03:38:16,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:16,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:38:16,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 03:38:16,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 03:38:16,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:16,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 03:38:17,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:38:17,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531744520] [2025-03-17 03:38:17,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531744520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:17,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:17,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:38:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668925237] [2025-03-17 03:38:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:17,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:38:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:38:17,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:38:17,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:38:17,680 INFO L87 Difference]: Start difference. First operand 120 states and 156 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:18,501 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2025-03-17 03:38:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 03:38:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 67 [2025-03-17 03:38:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:18,503 INFO L225 Difference]: With dead ends: 152 [2025-03-17 03:38:18,503 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 03:38:18,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:38:18,504 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 108 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:18,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 253 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:38:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 03:38:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 129. [2025-03-17 03:38:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 101 states have internal predecessors, (119), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:38:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2025-03-17 03:38:18,521 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 67 [2025-03-17 03:38:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:18,521 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2025-03-17 03:38:18,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2025-03-17 03:38:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 03:38:18,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:18,522 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:18,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:38:18,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:18,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash -682399114, now seen corresponding path program 1 times [2025-03-17 03:38:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:38:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74738203] [2025-03-17 03:38:18,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:18,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:38:18,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 03:38:18,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 03:38:18,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:18,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2025-03-17 03:38:18,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:38:18,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74738203] [2025-03-17 03:38:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74738203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:18,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:18,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:38:18,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35036325] [2025-03-17 03:38:18,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:18,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:38:18,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:38:18,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:38:18,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:38:18,574 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:38:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:18,586 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2025-03-17 03:38:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:38:18,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-17 03:38:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:18,588 INFO L225 Difference]: With dead ends: 133 [2025-03-17 03:38:18,588 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 03:38:18,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:38:18,589 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:18,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:38:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 03:38:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-03-17 03:38:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:38:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2025-03-17 03:38:18,599 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 129 [2025-03-17 03:38:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:18,600 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2025-03-17 03:38:18,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:38:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2025-03-17 03:38:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 03:38:18,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:18,601 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:18,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:38:18,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:18,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1409296410, now seen corresponding path program 1 times [2025-03-17 03:38:18,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:38:18,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532806783] [2025-03-17 03:38:18,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:38:18,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:38:18,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:38:18,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:18,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 62 proven. 3 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-17 03:38:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:38:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532806783] [2025-03-17 03:38:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532806783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:38:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979832109] [2025-03-17 03:38:18,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:18,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:38:18,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:38:18,828 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) [2025-03-17 03:38:18,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:38:18,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 03:38:18,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 03:38:18,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:18,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:18,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 03:38:18,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:38:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 331 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-17 03:38:24,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:38:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 50 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 03:38:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979832109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:38:25,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:38:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2025-03-17 03:38:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107202533] [2025-03-17 03:38:25,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:38:25,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:38:25,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:38:25,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:38:25,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:38:25,846 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-17 03:38:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:26,017 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2025-03-17 03:38:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:38:26,018 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 131 [2025-03-17 03:38:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:26,020 INFO L225 Difference]: With dead ends: 152 [2025-03-17 03:38:26,020 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 03:38:26,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-17 03:38:26,021 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 44 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:26,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 191 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:38:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 03:38:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-17 03:38:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 states have internal predecessors, (77), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:38:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-03-17 03:38:26,035 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 131 [2025-03-17 03:38:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:26,037 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-03-17 03:38:26,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-17 03:38:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-03-17 03:38:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 03:38:26,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:26,039 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:26,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:38:26,240 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,SelfDestructingSolverStorable7 [2025-03-17 03:38:26,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:26,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash -280293936, now seen corresponding path program 1 times [2025-03-17 03:38:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:38:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053500547] [2025-03-17 03:38:26,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:38:26,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 03:38:26,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 03:38:26,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:26,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:38:26,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166848116] [2025-03-17 03:38:26,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:26,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:38:26,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:38:26,291 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) [2025-03-17 03:38:26,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 03:38:26,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 03:38:26,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 03:38:26,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:26,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:38:26,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:38:26,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 03:38:26,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 03:38:26,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:26,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:38:26,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:38:26,566 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:38:26,567 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:38:26,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:38:26,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:38:26,774 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:26,831 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:38:26,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:38:26 BoogieIcfgContainer [2025-03-17 03:38:26,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:38:26,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:38:26,836 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:38:26,836 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:38:26,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:38:10" (3/4) ... [2025-03-17 03:38:26,838 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:38:26,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:38:26,839 INFO L158 Benchmark]: Toolchain (without parser) took 16493.46ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 110.5MB in the beginning and 660.8MB in the end (delta: -550.2MB). Peak memory consumption was 138.2MB. Max. memory is 16.1GB. [2025-03-17 03:38:26,840 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:38:26,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.74ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 99.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:38:26,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.88ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:38:26,841 INFO L158 Benchmark]: Boogie Preprocessor took 45.63ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:38:26,841 INFO L158 Benchmark]: IcfgBuilder took 337.19ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 77.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:38:26,841 INFO L158 Benchmark]: TraceAbstraction took 15897.06ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 77.4MB in the beginning and 661.0MB in the end (delta: -583.6MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2025-03-17 03:38:26,842 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 830.5MB. Free memory was 661.0MB in the beginning and 660.8MB in the end (delta: 267.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:38:26,843 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.67ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.74ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 99.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.88ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.63ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 337.19ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 77.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15897.06ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 77.4MB in the beginning and 661.0MB in the end (delta: -583.6MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 830.5MB. Free memory was 661.0MB in the beginning and 660.8MB in the end (delta: 267.8kB). 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 73, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] unsigned char var_1_7 = 200; [L24] unsigned char var_1_8 = 4; [L25] signed char var_1_9 = 50; [L26] signed char var_1_12 = -5; [L27] float var_1_13 = 999999999999.8; [L28] float var_1_14 = 100.5; [L29] float var_1_15 = 32.75; [L30] unsigned char var_1_16 = 1; [L31] unsigned char var_1_17 = 1; [L32] unsigned char var_1_18 = 128; [L33] unsigned char last_1_var_1_7 = 200; [L34] signed char last_1_var_1_9 = 50; [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-272, var_1_7=200, var_1_8=0, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=200, var_1_8=0, var_1_9=50] [L46] COND TRUE var_1_18 == var_1_18 [L47] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L49] signed short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_3=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L50] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L53] signed short int stepLocal_2 = var_1_1; [L54] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L55] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L56] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND FALSE !(!(cond)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L93] RET __VERIFIER_assert(property()) [L94] isInitial = 0 VAL [isInitial=0, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=128, var_1_7=0, var_1_8=128, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=0, var_1_8=128, var_1_9=50] [L46] COND TRUE var_1_18 == var_1_18 [L47] var_1_7 = var_1_8 VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L49] signed short int stepLocal_3 = var_1_1; VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_3=128, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L50] COND TRUE var_1_18 == stepLocal_3 [L51] var_1_13 = (var_1_14 - var_1_15) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L53] signed short int stepLocal_2 = var_1_1; [L54] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=128, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L55] COND TRUE \read(var_1_16) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=128, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L56] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_2=128, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L19] reach_error() VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 75 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 638 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 638 mSDsluCounter, 1446 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1073 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 813 IncrementalHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 373 mSDtfsCounter, 813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=6, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 107 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 1108 NumberOfCodeBlocks, 1108 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 962 ConstructedInterpolants, 0 QuantifiedInterpolants, 5111 SizeOfPredicates, 15 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 2781/2828 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:38:26,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_25-while_file-33.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 4d07f6d4eb00f77dbf0a6f761a1dfb43bb3a584f994c1eafe03cf0135e1262b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:38:28,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:38:28,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:38:28,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:38:28,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:38:28,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:38:28,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:38:28,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:38:28,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:38:28,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:38:28,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:38:28,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:38:28,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:38:28,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:38:28,912 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:38:28,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:38:28,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:38:28,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:38:28,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:38:28,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:38:28,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:38:28,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:38:28,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:38:28,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:38:28,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:38:28,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:38:28,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:38:28,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:38:28,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:38:28,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:38:28,915 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:38:28,915 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:38:28,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:38:28,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:38:28,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:38:28,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:38:28,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 4d07f6d4eb00f77dbf0a6f761a1dfb43bb3a584f994c1eafe03cf0135e1262b3 [2025-03-17 03:38:29,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:38:29,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:38:29,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:38:29,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:38:29,170 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:38:29,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2025-03-17 03:38:30,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c280bccd/c62dcc4314c3495585405b9b9099bc86/FLAG3834d20bd [2025-03-17 03:38:30,512 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:38:30,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2025-03-17 03:38:30,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c280bccd/c62dcc4314c3495585405b9b9099bc86/FLAG3834d20bd [2025-03-17 03:38:30,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c280bccd/c62dcc4314c3495585405b9b9099bc86 [2025-03-17 03:38:30,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:38:30,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:38:30,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:38:30,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:38:30,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:38:30,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100b8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30, skipping insertion in model container [2025-03-17 03:38:30,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:38:30,674 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_25-while_file-33.i[915,928] [2025-03-17 03:38:30,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:38:30,719 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:38:30,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i[915,928] [2025-03-17 03:38:30,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:38:30,756 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:38:30,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30 WrapperNode [2025-03-17 03:38:30,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:38:30,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:38:30,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:38:30,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:38:30,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,790 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-17 03:38:30,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:38:30,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:38:30,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:38:30,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:38:30,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,818 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]. [2025-03-17 03:38:30,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:38:30,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:38:30,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:38:30,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:38:30,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (1/1) ... [2025-03-17 03:38:30,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:38:30,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:38:30,876 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) [2025-03-17 03:38:30,880 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 [2025-03-17 03:38:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:38:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:38:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:38:30,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:38:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:38:30,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:38:30,967 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:38:30,969 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:38:31,268 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:38:31,268 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:38:31,279 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:38:31,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:38:31,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:38:31 BoogieIcfgContainer [2025-03-17 03:38:31,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:38:31,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:38:31,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:38:31,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:38:31,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:38:30" (1/3) ... [2025-03-17 03:38:31,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f213a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:38:31, skipping insertion in model container [2025-03-17 03:38:31,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:38:30" (2/3) ... [2025-03-17 03:38:31,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f213a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:38:31, skipping insertion in model container [2025-03-17 03:38:31,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:38:31" (3/3) ... [2025-03-17 03:38:31,289 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-33.i [2025-03-17 03:38:31,300 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:38:31,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-33.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:38:31,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:38:31,350 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;@305cb2ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:38:31,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:38:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 03:38:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 03:38:31,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:31,361 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:31,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:31,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash -248886521, now seen corresponding path program 1 times [2025-03-17 03:38:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:38:31,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772810411] [2025-03-17 03:38:31,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:31,371 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 [2025-03-17 03:38:31,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:38:31,374 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) [2025-03-17 03:38:31,375 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 [2025-03-17 03:38:31,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 03:38:31,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 03:38:31,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:31,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:31,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:38:31,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:38:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 03:38:31,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:38:31,542 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:38:31,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772810411] [2025-03-17 03:38:31,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772810411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:31,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:31,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:38:31,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876019314] [2025-03-17 03:38:31,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:31,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:38:31,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:38:31,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:38:31,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:38:31,564 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 03:38:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:31,577 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2025-03-17 03:38:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:38:31,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2025-03-17 03:38:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:31,582 INFO L225 Difference]: With dead ends: 67 [2025-03-17 03:38:31,583 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 03:38:31,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:38:31,587 INFO L435 NwaCegarLoop]: 45 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, 45 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 [2025-03-17 03:38:31,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:38:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 03:38:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 03:38:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 03:38:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2025-03-17 03:38:31,617 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 57 [2025-03-17 03:38:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:31,617 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-03-17 03:38:31,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 03:38:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2025-03-17 03:38:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 03:38:31,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:31,621 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:31,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:38:31,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:38:31,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:31,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash 467527593, now seen corresponding path program 1 times [2025-03-17 03:38:31,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:38:31,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563604017] [2025-03-17 03:38:31,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:31,823 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 [2025-03-17 03:38:31,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:38:31,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:38:31,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:38:31,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 03:38:31,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 03:38:31,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:31,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:31,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 03:38:31,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:38:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 03:38:32,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:38:32,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:38:32,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563604017] [2025-03-17 03:38:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563604017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:32,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:38:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268624371] [2025-03-17 03:38:32,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:32,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:38:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:38:32,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:38:32,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:38:32,106 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:32,318 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2025-03-17 03:38:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:38:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2025-03-17 03:38:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:32,322 INFO L225 Difference]: With dead ends: 103 [2025-03-17 03:38:32,323 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 03:38:32,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:38:32,323 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 50 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:32,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:38:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 03:38:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2025-03-17 03:38:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:38:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-03-17 03:38:32,342 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 57 [2025-03-17 03:38:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:32,343 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-03-17 03:38:32,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2025-03-17 03:38:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 03:38:32,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:32,345 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:32,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 03:38:32,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:38:32,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:32,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash 271014088, now seen corresponding path program 1 times [2025-03-17 03:38:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:38:32,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121185485] [2025-03-17 03:38:32,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:32,546 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 [2025-03-17 03:38:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:38:32,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:38:32,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 03:38:32,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 03:38:32,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 03:38:32,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:32,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:32,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 03:38:32,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:38:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 03:38:32,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:38:32,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:38:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121185485] [2025-03-17 03:38:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121185485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:38:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637156772] [2025-03-17 03:38:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:32,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:38:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:38:32,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:38:32,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:38:32,805 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:33,061 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2025-03-17 03:38:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:38:33,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2025-03-17 03:38:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:33,064 INFO L225 Difference]: With dead ends: 198 [2025-03-17 03:38:33,064 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 03:38:33,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:38:33,065 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 67 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:33,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 236 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:38:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 03:38:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 86. [2025-03-17 03:38:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:38:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2025-03-17 03:38:33,087 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 57 [2025-03-17 03:38:33,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:33,088 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2025-03-17 03:38:33,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2025-03-17 03:38:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 03:38:33,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:33,088 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:33,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 03:38:33,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:38:33,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:33,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 299643239, now seen corresponding path program 1 times [2025-03-17 03:38:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:38:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707254258] [2025-03-17 03:38:33,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:33,290 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 [2025-03-17 03:38:33,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:38:33,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:38:33,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 03:38:33,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 03:38:33,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 03:38:33,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:33,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:33,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:38:33,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:38:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 03:38:33,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:38:33,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:38:33,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707254258] [2025-03-17 03:38:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707254258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:38:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173343458] [2025-03-17 03:38:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:33,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:38:33,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:38:33,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:38:33,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:38:33,503 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 03:38:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:33,790 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2025-03-17 03:38:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:38:33,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2025-03-17 03:38:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:33,795 INFO L225 Difference]: With dead ends: 178 [2025-03-17 03:38:33,795 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 03:38:33,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-03-17 03:38:33,796 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 76 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:33,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 93 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:38:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 03:38:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2025-03-17 03:38:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.118421052631579) internal successors, (85), 76 states have internal predecessors, (85), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:38:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2025-03-17 03:38:33,820 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 57 [2025-03-17 03:38:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:33,821 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2025-03-17 03:38:33,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 03:38:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2025-03-17 03:38:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 03:38:33,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:33,821 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:33,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 03:38:34,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:38:34,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:34,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash 698203416, now seen corresponding path program 1 times [2025-03-17 03:38:34,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:38:34,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008855670] [2025-03-17 03:38:34,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:34,023 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 [2025-03-17 03:38:34,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:38:34,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:38:34,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 03:38:34,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 03:38:34,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 03:38:34,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:34,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:34,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:38:34,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:38:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 03:38:45,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:38:45,252 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:38:45,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008855670] [2025-03-17 03:38:45,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008855670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:45,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:45,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:38:45,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455501668] [2025-03-17 03:38:45,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:45,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:38:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:38:45,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:38:45,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:38:45,254 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:45,616 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2025-03-17 03:38:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:38:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2025-03-17 03:38:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:45,618 INFO L225 Difference]: With dead ends: 120 [2025-03-17 03:38:45,618 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 03:38:45,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:38:45,618 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:45,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 155 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:38:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 03:38:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-03-17 03:38:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:38:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2025-03-17 03:38:45,631 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 58 [2025-03-17 03:38:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:45,631 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2025-03-17 03:38:45,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2025-03-17 03:38:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 03:38:45,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:45,633 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:45,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 03:38:45,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 [2025-03-17 03:38:45,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:45,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash 168577642, now seen corresponding path program 1 times [2025-03-17 03:38:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:38:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929082221] [2025-03-17 03:38:45,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:45,835 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 [2025-03-17 03:38:45,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:38:45,837 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2025-03-17 03:38:45,838 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 (7)] Waiting until timeout for monitored process [2025-03-17 03:38:45,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 03:38:45,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 03:38:45,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:45,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:45,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 03:38:45,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:38:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 03:38:45,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:38:45,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:38:45,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929082221] [2025-03-17 03:38:45,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929082221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:38:45,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:38:45,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:38:45,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812868903] [2025-03-17 03:38:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:38:45,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:38:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:38:45,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:38:45,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:38:45,950 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:38:46,005 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2025-03-17 03:38:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:38:46,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2025-03-17 03:38:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:38:46,009 INFO L225 Difference]: With dead ends: 120 [2025-03-17 03:38:46,009 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 03:38:46,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:38:46,010 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:38:46,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:38:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 03:38:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-03-17 03:38:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:38:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2025-03-17 03:38:46,019 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 59 [2025-03-17 03:38:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:38:46,020 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2025-03-17 03:38:46,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 03:38:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2025-03-17 03:38:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 03:38:46,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:38:46,021 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:38:46,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 03:38:46,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 [2025-03-17 03:38:46,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:38:46,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:38:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1859461413, now seen corresponding path program 1 times [2025-03-17 03:38:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:38:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265167205] [2025-03-17 03:38:46,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:38:46,223 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 [2025-03-17 03:38:46,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:38:46,227 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2025-03-17 03:38:46,227 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 (8)] Waiting until timeout for monitored process [2025-03-17 03:38:46,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:38:46,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:38:46,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:38:46,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:38:46,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 03:38:46,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:39:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 346 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 03:39:08,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:39:32,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:39:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265167205] [2025-03-17 03:39:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265167205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:39:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1924456583] [2025-03-17 03:39:32,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:39:32,524 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 03:39:32,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 03:39:32,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 03:39:32,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-17 03:39:32,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 03:39:32,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 03:39:32,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:39:32,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:39:32,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 03:39:32,934 INFO L279 TraceCheckSpWp]: Computing forward predicates...