./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 57aa769afed4a061f728787b55a05b2a082848f9dc6ce06d34092eb1dbdd7a2a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:35:49,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:35:49,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:35:49,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:35:49,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:35:49,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:35:49,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:35:49,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:35:49,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:35:49,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:35:49,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:35:49,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:35:49,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:35:49,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:35:49,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:35:49,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:35:49,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:35:49,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:35:49,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:35:49,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:35:49,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:35:49,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:35:49,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:35:49,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:35:49,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:35:49,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:35:49,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:35:49,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:35:49,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:35:49,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:35:49,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:35:49,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:35:49,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:35:49,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:35:49,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:35:49,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:35:49,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:35:49,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:35:49,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:35:49,347 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-jdk21/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 -> 57aa769afed4a061f728787b55a05b2a082848f9dc6ce06d34092eb1dbdd7a2a [2025-01-09 13:35:49,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:35:49,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:35:49,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:35:49,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:35:49,579 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:35:49,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i [2025-01-09 13:35:50,707 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bad24234/e78769ab678547db9dd48efb6c97dfe4/FLAGe7c6209d8 [2025-01-09 13:35:50,926 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:35:50,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i [2025-01-09 13:35:50,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bad24234/e78769ab678547db9dd48efb6c97dfe4/FLAGe7c6209d8 [2025-01-09 13:35:51,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bad24234/e78769ab678547db9dd48efb6c97dfe4 [2025-01-09 13:35:51,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:35:51,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:35:51,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:35:51,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:35:51,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:35:51,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51, skipping insertion in model container [2025-01-09 13:35:51,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:35:51,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i[915,928] [2025-01-09 13:35:51,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:35:51,438 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:35:51,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i[915,928] [2025-01-09 13:35:51,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:35:51,465 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:35:51,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51 WrapperNode [2025-01-09 13:35:51,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:35:51,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:35:51,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:35:51,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:35:51,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,488 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-01-09 13:35:51,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:35:51,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:35:51,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:35:51,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:35:51,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,504 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-01-09 13:35:51,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,507 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:35:51,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:35:51,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:35:51,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:35:51,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (1/1) ... [2025-01-09 13:35:51,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:35:51,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:35:51,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:35:51,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:35:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:35:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:35:51,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:35:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:35:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:35:51,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:35:51,603 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:35:51,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:35:51,766 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 13:35:51,766 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:35:51,773 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:35:51,773 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:35:51,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:35:51 BoogieIcfgContainer [2025-01-09 13:35:51,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:35:51,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:35:51,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:35:51,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:35:51,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:35:51" (1/3) ... [2025-01-09 13:35:51,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520301c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:35:51, skipping insertion in model container [2025-01-09 13:35:51,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:35:51" (2/3) ... [2025-01-09 13:35:51,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520301c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:35:51, skipping insertion in model container [2025-01-09 13:35:51,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:35:51" (3/3) ... [2025-01-09 13:35:51,782 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-87.i [2025-01-09 13:35:51,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:35:51,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-87.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:35:51,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:35:51,844 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;@3cac9e47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:35:51,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:35:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:35:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 13:35:51,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:35:51,854 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:35:51,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:35:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:35:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1193585297, now seen corresponding path program 1 times [2025-01-09 13:35:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:35:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099318185] [2025-01-09 13:35:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:35:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:35:51,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 13:35:51,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 13:35:51,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:35:51,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:35:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 13:35:52,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:35:52,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099318185] [2025-01-09 13:35:52,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099318185] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:35:52,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438087861] [2025-01-09 13:35:52,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:35:52,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:35:52,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:35:52,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:35:52,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:35:52,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 13:35:52,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 13:35:52,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:35:52,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:35:52,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:35:52,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:35:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 13:35:52,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:35:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438087861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:35:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:35:52,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:35:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429985993] [2025-01-09 13:35:52,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:35:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:35:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:35:52,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:35:52,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:35:52,164 INFO L87 Difference]: Start difference. First operand has 56 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:35:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:35:52,183 INFO L93 Difference]: Finished difference Result 106 states and 171 transitions. [2025-01-09 13:35:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:35:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 96 [2025-01-09 13:35:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:35:52,189 INFO L225 Difference]: With dead ends: 106 [2025-01-09 13:35:52,190 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 13:35:52,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-01-09 13:35:52,195 INFO L435 NwaCegarLoop]: 76 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, 76 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-01-09 13:35:52,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:35:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 13:35:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 13:35:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:35:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2025-01-09 13:35:52,220 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 96 [2025-01-09 13:35:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:35:52,220 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2025-01-09 13:35:52,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:35:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2025-01-09 13:35:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 13:35:52,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:35:52,223 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:35:52,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:35:52,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:35:52,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:35:52,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:35:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1586710037, now seen corresponding path program 1 times [2025-01-09 13:35:52,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:35:52,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-01-09 13:35:52,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:35:52,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:35:52,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 13:35:52,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 13:35:52,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:35:52,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:35:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:35:57,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:35:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-01-09 13:35:57,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256298778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:35:57,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:35:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:35:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578157190] [2025-01-09 13:35:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:35:57,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:35:57,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:35:57,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:35:57,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:35:57,594 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:35:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:35:57,912 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2025-01-09 13:35:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:35:57,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2025-01-09 13:35:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:35:57,914 INFO L225 Difference]: With dead ends: 141 [2025-01-09 13:35:57,914 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 13:35:57,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:35:57,915 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 112 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:35:57,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 316 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:35:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 13:35:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 61. [2025-01-09 13:35:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:35:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2025-01-09 13:35:57,928 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 96 [2025-01-09 13:35:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:35:57,930 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2025-01-09 13:35:57,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:35:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2025-01-09 13:35:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:35:57,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:35:57,932 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:35:57,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:35:57,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:35:57,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:35:57,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2080737485, now seen corresponding path program 1 times [2025-01-09 13:35:57,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:35:57,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607324875] [2025-01-09 13:35:57,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:35:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:35:57,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:35:57,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:35:57,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:35:57,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:35:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:35:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:35:59,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607324875] [2025-01-09 13:35:59,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607324875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:35:59,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:35:59,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:35:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019774421] [2025-01-09 13:35:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:35:59,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:35:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:35:59,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:35:59,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:35:59,365 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:35:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:35:59,470 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions. [2025-01-09 13:35:59,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:35:59,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-01-09 13:35:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:35:59,472 INFO L225 Difference]: With dead ends: 138 [2025-01-09 13:35:59,472 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 13:35:59,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:35:59,473 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 65 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:35:59,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 206 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:35:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 13:35:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2025-01-09 13:35:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:35:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2025-01-09 13:35:59,483 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 97 [2025-01-09 13:35:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:35:59,484 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2025-01-09 13:35:59,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:35:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2025-01-09 13:35:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:35:59,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:35:59,485 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:35:59,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:35:59,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:35:59,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:35:59,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1602092276, now seen corresponding path program 1 times [2025-01-09 13:35:59,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:35:59,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653962064] [2025-01-09 13:35:59,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:35:59,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:35:59,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:35:59,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:35:59,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:35:59,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653962064] [2025-01-09 13:36:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653962064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:06,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:06,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 13:36:06,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953344624] [2025-01-09 13:36:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:06,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:36:06,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:06,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:36:06,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:36:06,312 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:06,859 INFO L93 Difference]: Finished difference Result 207 states and 291 transitions. [2025-01-09 13:36:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:36:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-01-09 13:36:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:06,861 INFO L225 Difference]: With dead ends: 207 [2025-01-09 13:36:06,861 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 13:36:06,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:36:06,862 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 141 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:06,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 311 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:36:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 13:36:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 68. [2025-01-09 13:36:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:36:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2025-01-09 13:36:06,868 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 97 [2025-01-09 13:36:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:06,869 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2025-01-09 13:36:06,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2025-01-09 13:36:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:36:06,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:06,870 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:06,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:36:06,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:06,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:06,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1343926838, now seen corresponding path program 1 times [2025-01-09 13:36:06,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446553499] [2025-01-09 13:36:06,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:06,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:06,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:36:06,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:36:06,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:06,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446553499] [2025-01-09 13:36:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446553499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:07,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:07,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:36:07,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290467010] [2025-01-09 13:36:07,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:36:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:07,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:36:07,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:36:07,056 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:07,261 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2025-01-09 13:36:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:36:07,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-01-09 13:36:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:07,263 INFO L225 Difference]: With dead ends: 197 [2025-01-09 13:36:07,263 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 13:36:07,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:36:07,265 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 70 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:07,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 357 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:36:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 13:36:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2025-01-09 13:36:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:36:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-01-09 13:36:07,283 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 97 [2025-01-09 13:36:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:07,283 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-01-09 13:36:07,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-01-09 13:36:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:36:07,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:07,284 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:07,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:36:07,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:07,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1413011342, now seen corresponding path program 1 times [2025-01-09 13:36:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:07,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434756095] [2025-01-09 13:36:07,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:07,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:36:07,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:36:07,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:07,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:08,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:08,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434756095] [2025-01-09 13:36:08,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434756095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:08,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:08,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 13:36:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116462803] [2025-01-09 13:36:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:08,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:36:08,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:08,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:36:08,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:36:08,813 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:09,160 INFO L93 Difference]: Finished difference Result 321 states and 456 transitions. [2025-01-09 13:36:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:36:09,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-01-09 13:36:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:09,163 INFO L225 Difference]: With dead ends: 321 [2025-01-09 13:36:09,164 INFO L226 Difference]: Without dead ends: 212 [2025-01-09 13:36:09,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:36:09,166 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 103 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:09,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 352 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:36:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-09 13:36:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 178. [2025-01-09 13:36:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 141 states have (on average 1.3687943262411348) internal successors, (193), 143 states have internal predecessors, (193), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:36:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 257 transitions. [2025-01-09 13:36:09,190 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 257 transitions. Word has length 97 [2025-01-09 13:36:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:09,191 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 257 transitions. [2025-01-09 13:36:09,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 257 transitions. [2025-01-09 13:36:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:36:09,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:09,192 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:36:09,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1671176780, now seen corresponding path program 1 times [2025-01-09 13:36:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446024898] [2025-01-09 13:36:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:09,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:36:09,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:36:09,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:09,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:09,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446024898] [2025-01-09 13:36:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446024898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:09,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:36:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472875441] [2025-01-09 13:36:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:09,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:36:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:09,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:36:09,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:36:09,287 INFO L87 Difference]: Start difference. First operand 178 states and 257 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:09,356 INFO L93 Difference]: Finished difference Result 337 states and 487 transitions. [2025-01-09 13:36:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:36:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-01-09 13:36:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:09,357 INFO L225 Difference]: With dead ends: 337 [2025-01-09 13:36:09,357 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 13:36:09,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:36:09,358 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 46 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:09,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 324 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:36:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 13:36:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2025-01-09 13:36:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 133 states have internal predecessors, (176), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:36:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 240 transitions. [2025-01-09 13:36:09,382 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 240 transitions. Word has length 97 [2025-01-09 13:36:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:09,382 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 240 transitions. [2025-01-09 13:36:09,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 240 transitions. [2025-01-09 13:36:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 13:36:09,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:09,385 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:09,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:36:09,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:09,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash -663411578, now seen corresponding path program 1 times [2025-01-09 13:36:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:09,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-01-09 13:36:09,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:09,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:09,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 13:36:09,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 13:36:09,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:15,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-01-09 13:36:15,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372130691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:15,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:15,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:36:15,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258402214] [2025-01-09 13:36:15,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:15,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:36:15,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:15,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:36:15,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:36:15,422 INFO L87 Difference]: Start difference. First operand 168 states and 240 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:18,390 INFO L93 Difference]: Finished difference Result 202 states and 278 transitions. [2025-01-09 13:36:18,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:36:18,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-01-09 13:36:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:18,392 INFO L225 Difference]: With dead ends: 202 [2025-01-09 13:36:18,392 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 13:36:18,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:36:18,392 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:18,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 438 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 13:36:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 13:36:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2025-01-09 13:36:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 143 states have internal predecessors, (189), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:36:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 253 transitions. [2025-01-09 13:36:18,409 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 253 transitions. Word has length 98 [2025-01-09 13:36:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:18,409 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 253 transitions. [2025-01-09 13:36:18,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 253 transitions. [2025-01-09 13:36:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 13:36:18,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:18,410 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:18,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:36:18,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:18,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:18,410 INFO L85 PathProgramCache]: Analyzing trace with hash -211982130, now seen corresponding path program 1 times [2025-01-09 13:36:18,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:18,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578332747] [2025-01-09 13:36:18,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:18,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:18,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 13:36:18,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 13:36:18,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:18,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:23,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578332747] [2025-01-09 13:36:23,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578332747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:23,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:23,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:36:23,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37516144] [2025-01-09 13:36:23,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:23,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:36:23,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:23,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:36:23,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:36:23,306 INFO L87 Difference]: Start difference. First operand 178 states and 253 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:23,569 INFO L93 Difference]: Finished difference Result 325 states and 458 transitions. [2025-01-09 13:36:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:36:23,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-01-09 13:36:23,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:23,570 INFO L225 Difference]: With dead ends: 325 [2025-01-09 13:36:23,570 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 13:36:23,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:36:23,571 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 49 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:23,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 353 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:36:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 13:36:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 168. [2025-01-09 13:36:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 133 states have internal predecessors, (173), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:36:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 237 transitions. [2025-01-09 13:36:23,587 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 237 transitions. Word has length 98 [2025-01-09 13:36:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:23,588 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 237 transitions. [2025-01-09 13:36:23,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 237 transitions. [2025-01-09 13:36:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 13:36:23,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:23,589 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:23,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 13:36:23,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:23,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash -798788144, now seen corresponding path program 1 times [2025-01-09 13:36:23,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:23,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49895653] [2025-01-09 13:36:23,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:23,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 13:36:23,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 13:36:23,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:23,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:25,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49895653] [2025-01-09 13:36:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49895653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:25,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:25,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:36:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154288348] [2025-01-09 13:36:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:25,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:36:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:25,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:36:25,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:36:25,514 INFO L87 Difference]: Start difference. First operand 168 states and 237 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:25,761 INFO L93 Difference]: Finished difference Result 289 states and 403 transitions. [2025-01-09 13:36:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:36:25,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-01-09 13:36:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:25,763 INFO L225 Difference]: With dead ends: 289 [2025-01-09 13:36:25,763 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 13:36:25,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:36:25,764 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 49 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:25,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 335 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:36:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 13:36:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2025-01-09 13:36:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3129770992366412) internal successors, (172), 133 states have internal predecessors, (172), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:36:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 236 transitions. [2025-01-09 13:36:25,775 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 236 transitions. Word has length 98 [2025-01-09 13:36:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:25,776 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 236 transitions. [2025-01-09 13:36:25,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 236 transitions. [2025-01-09 13:36:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 13:36:25,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:25,777 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:25,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:36:25,777 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:25,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1684479932, now seen corresponding path program 1 times [2025-01-09 13:36:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592301311] [2025-01-09 13:36:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:25,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 13:36:25,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 13:36:25,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:25,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:30,894 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:30,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:30,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592301311] [2025-01-09 13:36:30,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592301311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:30,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:30,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:36:30,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481360309] [2025-01-09 13:36:30,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:30,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:36:30,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:30,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:36:30,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:36:30,895 INFO L87 Difference]: Start difference. First operand 168 states and 236 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:32,448 INFO L93 Difference]: Finished difference Result 251 states and 342 transitions. [2025-01-09 13:36:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:36:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-01-09 13:36:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:32,450 INFO L225 Difference]: With dead ends: 251 [2025-01-09 13:36:32,450 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 13:36:32,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:36:32,450 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 55 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:32,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 351 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:36:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 13:36:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 241. [2025-01-09 13:36:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 196 states have internal predecessors, (244), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:36:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 328 transitions. [2025-01-09 13:36:32,472 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 328 transitions. Word has length 98 [2025-01-09 13:36:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:32,473 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 328 transitions. [2025-01-09 13:36:32,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 328 transitions. [2025-01-09 13:36:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 13:36:32,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:32,474 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:32,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 13:36:32,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:32,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:32,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1671897178, now seen corresponding path program 1 times [2025-01-09 13:36:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:32,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825959660] [2025-01-09 13:36:32,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:32,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 13:36:32,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 13:36:32,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:32,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:32,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:32,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825959660] [2025-01-09 13:36:32,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825959660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:32,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:32,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:36:32,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629807699] [2025-01-09 13:36:32,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:32,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:36:32,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:32,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:36:32,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:36:32,508 INFO L87 Difference]: Start difference. First operand 241 states and 328 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:32,551 INFO L93 Difference]: Finished difference Result 534 states and 724 transitions. [2025-01-09 13:36:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:36:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2025-01-09 13:36:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:32,553 INFO L225 Difference]: With dead ends: 534 [2025-01-09 13:36:32,553 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 13:36:32,554 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-01-09 13:36:32,554 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 24 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:32,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 144 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:36:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 13:36:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 240. [2025-01-09 13:36:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 191 states have (on average 1.2984293193717278) internal successors, (248), 195 states have internal predecessors, (248), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:36:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 328 transitions. [2025-01-09 13:36:32,576 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 328 transitions. Word has length 99 [2025-01-09 13:36:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:32,576 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 328 transitions. [2025-01-09 13:36:32,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 328 transitions. [2025-01-09 13:36:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 13:36:32,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:32,577 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:32,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 13:36:32,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:32,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash -814353686, now seen corresponding path program 1 times [2025-01-09 13:36:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:32,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863889373] [2025-01-09 13:36:32,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:32,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 13:36:32,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 13:36:32,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:32,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:32,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:32,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863889373] [2025-01-09 13:36:32,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863889373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:32,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:32,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:36:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677351586] [2025-01-09 13:36:32,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:32,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:36:32,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:32,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:36:32,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:36:32,901 INFO L87 Difference]: Start difference. First operand 240 states and 328 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:33,132 INFO L93 Difference]: Finished difference Result 322 states and 421 transitions. [2025-01-09 13:36:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:36:33,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2025-01-09 13:36:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:33,135 INFO L225 Difference]: With dead ends: 322 [2025-01-09 13:36:33,135 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 13:36:33,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:36:33,136 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 41 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:33,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 505 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:36:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 13:36:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 256. [2025-01-09 13:36:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 211 states have internal predecessors, (269), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:36:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 349 transitions. [2025-01-09 13:36:33,159 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 349 transitions. Word has length 99 [2025-01-09 13:36:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:33,160 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 349 transitions. [2025-01-09 13:36:33,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 349 transitions. [2025-01-09 13:36:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 13:36:33,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:33,160 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:33,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 13:36:33,161 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:33,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1494412056, now seen corresponding path program 1 times [2025-01-09 13:36:33,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:33,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050190653] [2025-01-09 13:36:33,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:33,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:33,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 13:36:33,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 13:36:33,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:33,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:36:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:36:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050190653] [2025-01-09 13:36:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050190653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:37,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:37,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 13:36:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195402599] [2025-01-09 13:36:37,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:37,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:36:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:36:37,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:36:37,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:36:37,461 INFO L87 Difference]: Start difference. First operand 256 states and 349 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:41,434 INFO L93 Difference]: Finished difference Result 317 states and 419 transitions. [2025-01-09 13:36:41,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:36:41,436 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2025-01-09 13:36:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:41,439 INFO L225 Difference]: With dead ends: 317 [2025-01-09 13:36:41,440 INFO L226 Difference]: Without dead ends: 315 [2025-01-09 13:36:41,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:36:41,440 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 67 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:41,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 553 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:36:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-01-09 13:36:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 260. [2025-01-09 13:36:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 211 states have (on average 1.3080568720379147) internal successors, (276), 215 states have internal predecessors, (276), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:36:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 356 transitions. [2025-01-09 13:36:41,463 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 356 transitions. Word has length 99 [2025-01-09 13:36:41,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:41,463 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 356 transitions. [2025-01-09 13:36:41,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:36:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 356 transitions. [2025-01-09 13:36:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 13:36:41,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:41,464 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:41,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 13:36:41,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:41,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1317580750, now seen corresponding path program 1 times [2025-01-09 13:36:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:36:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893535972] [2025-01-09 13:36:41,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:36:41,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 13:36:41,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 13:36:41,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:41,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:36:41,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293582518] [2025-01-09 13:36:41,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:41,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:36:41,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:36:41,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:36:41,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:36:41,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 13:36:41,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 13:36:41,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:41,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:36:41,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:36:41,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 13:36:41,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 13:36:41,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:41,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:36:41,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:36:41,636 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:36:41,637 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:36:41,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:36:41,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 13:36:41,841 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:36:41,900 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:36:41,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:36:41 BoogieIcfgContainer [2025-01-09 13:36:41,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:36:41,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:36:41,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:36:41,905 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:36:41,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:35:51" (3/4) ... [2025-01-09 13:36:41,908 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:36:41,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:36:41,910 INFO L158 Benchmark]: Toolchain (without parser) took 50615.62ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 113.3MB in the beginning and 478.8MB in the end (delta: -365.5MB). Peak memory consumption was 563.7MB. Max. memory is 16.1GB. [2025-01-09 13:36:41,910 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:36:41,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.41ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 100.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:36:41,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.20ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:36:41,910 INFO L158 Benchmark]: Boogie Preprocessor took 22.51ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:36:41,911 INFO L158 Benchmark]: RCFGBuilder took 260.80ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 81.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:36:41,911 INFO L158 Benchmark]: TraceAbstraction took 50129.92ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 80.4MB in the beginning and 479.0MB in the end (delta: -398.6MB). Peak memory consumption was 530.1MB. Max. memory is 16.1GB. [2025-01-09 13:36:41,911 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 1.1GB. Free memory was 479.0MB in the beginning and 478.8MB in the end (delta: 225.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:36:41,913 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.18ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.41ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 100.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.20ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.51ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 260.80ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 81.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 50129.92ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 80.4MB in the beginning and 479.0MB in the end (delta: -398.6MB). Peak memory consumption was 530.1MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 1.1GB. Free memory was 479.0MB in the beginning and 478.8MB in the end (delta: 225.3kB). 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 93, overapproximation of someBinaryFLOATComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 3164414017; [L25] unsigned long int var_1_4 = 128; [L26] signed char var_1_5 = -128; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 50; [L29] float var_1_8 = 5.1; [L30] float var_1_9 = 63.75; [L31] signed char var_1_10 = 100; [L32] signed long int var_1_12 = 5; [L33] signed char last_1_var_1_10 = 100; VAL [isInitial=0, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L97] isInitial = 1 [L98] FCALL initially() [L100] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L71] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L73] var_1_4 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L76] var_1_6 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_6 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L77] RET assume_abort_if_not(var_1_6 >= -126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L79] var_1_7 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L82] var_1_9 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L83] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L84] var_1_12 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L85] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L101] RET updateVariables() [L102] CALL step() [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L40] signed long int stepLocal_1 = -8; [L41] unsigned long int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=2147483647, stepLocal_1=-8, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L42] COND FALSE !(stepLocal_1 < var_1_4) [L49] var_1_5 = -2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=2147483647, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L51] unsigned long int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=2147483647, stepLocal_3=2147483647, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=2147483647, stepLocal_3=2147483647, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] unsigned long int stepLocal_2 = var_1_4 >> var_1_3; [L53] COND TRUE var_1_6 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=2147483647, stepLocal_3=2147483647, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L54] COND TRUE var_1_6 != stepLocal_3 [L55] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=2147483647, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L58] COND FALSE !((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=2147483647, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93-L94] return (((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1)) && (((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) ? ((var_1_7 >= last_1_var_1_10) ? (var_1_10 == ((signed char) -32)) : (var_1_10 == ((signed char) var_1_7))) : 1) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=127, var_1_1=2147483647, var_1_2=1, var_1_3=-2147483649, var_1_4=-4294967296, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.0s, OverallIterations: 15, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 899 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 899 mSDsluCounter, 4621 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3548 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2635 IncrementalHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 1073 mSDtfsCounter, 2635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=14, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 445 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 37.5s InterpolantComputationTime, 1660 NumberOfCodeBlocks, 1660 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1447 ConstructedInterpolants, 0 QuantifiedInterpolants, 14298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 5434/5460 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-01-09 13:36:42,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 57aa769afed4a061f728787b55a05b2a082848f9dc6ce06d34092eb1dbdd7a2a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:36:43,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:36:43,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:36:43,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:36:43,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:36:43,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:36:43,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:36:43,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:36:43,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:36:43,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:36:43,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:36:43,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:36:43,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:36:43,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:36:43,981 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:36:43,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:36:43,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:36:43,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:36:43,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:36:43,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:36:43,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:36:43,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:36:43,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:36:43,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:36:43,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:36:43,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:36:43,985 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:36:43,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:36:43,985 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:36:43,985 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:36:43,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:36:43,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:36:43,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:36:43,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:36:43,985 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-jdk21/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 -> 57aa769afed4a061f728787b55a05b2a082848f9dc6ce06d34092eb1dbdd7a2a [2025-01-09 13:36:44,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:36:44,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:36:44,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:36:44,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:36:44,249 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:36:44,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i [2025-01-09 13:36:45,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02af3c555/df63ccdacf4a4af6b1f5ab3523d946ec/FLAGed0e6cf9a [2025-01-09 13:36:45,709 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:36:45,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i [2025-01-09 13:36:45,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02af3c555/df63ccdacf4a4af6b1f5ab3523d946ec/FLAGed0e6cf9a [2025-01-09 13:36:45,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02af3c555/df63ccdacf4a4af6b1f5ab3523d946ec [2025-01-09 13:36:45,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:36:45,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:36:45,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:36:45,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:36:45,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:36:45,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:45,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9be0c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45, skipping insertion in model container [2025-01-09 13:36:45,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:45,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:36:45,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i[915,928] [2025-01-09 13:36:45,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:36:45,929 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:36:45,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-87.i[915,928] [2025-01-09 13:36:45,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:36:45,971 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:36:45,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45 WrapperNode [2025-01-09 13:36:45,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:36:45,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:36:45,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:36:45,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:36:45,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:45,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,008 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-01-09 13:36:46,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:36:46,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:36:46,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:36:46,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:36:46,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,034 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-01-09 13:36:46,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:36:46,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:36:46,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:36:46,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:36:46,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (1/1) ... [2025-01-09 13:36:46,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:36:46,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:36:46,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:36:46,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:36:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:36:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:36:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:36:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:36:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:36:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:36:46,174 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:36:46,175 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:36:46,357 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 13:36:46,357 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:36:46,363 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:36:46,364 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:36:46,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:36:46 BoogieIcfgContainer [2025-01-09 13:36:46,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:36:46,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:36:46,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:36:46,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:36:46,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:36:45" (1/3) ... [2025-01-09 13:36:46,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cfe747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:36:46, skipping insertion in model container [2025-01-09 13:36:46,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:36:45" (2/3) ... [2025-01-09 13:36:46,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cfe747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:36:46, skipping insertion in model container [2025-01-09 13:36:46,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:36:46" (3/3) ... [2025-01-09 13:36:46,371 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-87.i [2025-01-09 13:36:46,382 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:36:46,383 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-87.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:36:46,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:36:46,427 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;@7d1e1bd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:36:46,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:36:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:36:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 13:36:46,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:46,436 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:46,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:46,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1688112523, now seen corresponding path program 1 times [2025-01-09 13:36:46,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:36:46,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197817408] [2025-01-09 13:36:46,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:46,448 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-01-09 13:36:46,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:36:46,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 13:36:46,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:36:46,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:36:46,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:36:46,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:46,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:46,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:36:46,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:36:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-01-09 13:36:46,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:36:46,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:36:46,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197817408] [2025-01-09 13:36:46,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197817408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:36:46,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:36:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:36:46,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399274285] [2025-01-09 13:36:46,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:36:46,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:36:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:36:46,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:36:46,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:36:46,692 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:36:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:46,711 INFO L93 Difference]: Finished difference Result 90 states and 149 transitions. [2025-01-09 13:36:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:36:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-01-09 13:36:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:46,719 INFO L225 Difference]: With dead ends: 90 [2025-01-09 13:36:46,720 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 13:36:46,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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-01-09 13:36:46,725 INFO L435 NwaCegarLoop]: 65 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, 65 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-01-09 13:36:46,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:36:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 13:36:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 13:36:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:36:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2025-01-09 13:36:46,760 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 92 [2025-01-09 13:36:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:46,760 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2025-01-09 13:36:46,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:36:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2025-01-09 13:36:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 13:36:46,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:46,763 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:46,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:36:46,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 13:36:46,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:46,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1236111367, now seen corresponding path program 1 times [2025-01-09 13:36:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:36:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417509217] [2025-01-09 13:36:46,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:46,967 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-01-09 13:36:46,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:36:46,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 13:36:46,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:36:47,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:36:47,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:36:47,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:47,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:47,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:36:47,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:36:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 54 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 13:36:47,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:36:47,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:36:47,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417509217] [2025-01-09 13:36:47,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417509217] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:36:47,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [891818224] [2025-01-09 13:36:47,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:47,606 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:36:47,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:36:47,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 13:36:47,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 13:36:47,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 13:36:48,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 13:36:48,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:48,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:48,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 13:36:48,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:36:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 54 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 13:36:48,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:36:48,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [891818224] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:36:48,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:36:48,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2025-01-09 13:36:48,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568288933] [2025-01-09 13:36:48,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:36:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:36:48,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:36:48,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:36:48,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:36:48,339 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 13:36:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:36:48,662 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2025-01-09 13:36:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 13:36:48,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2025-01-09 13:36:48,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:36:48,670 INFO L225 Difference]: With dead ends: 99 [2025-01-09 13:36:48,670 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 13:36:48,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:36:48,672 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 28 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:36:48,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 136 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:36:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 13:36:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-01-09 13:36:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:36:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2025-01-09 13:36:48,686 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 92 [2025-01-09 13:36:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:36:48,686 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2025-01-09 13:36:48,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 13:36:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2025-01-09 13:36:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 13:36:48,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:36:48,688 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:36:48,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:36:48,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 13:36:49,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 13:36:49,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:36:49,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:36:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash 666046805, now seen corresponding path program 1 times [2025-01-09 13:36:49,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:36:49,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102743772] [2025-01-09 13:36:49,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:36:49,090 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-01-09 13:36:49,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:36:49,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 13:36:49,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:36:49,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 13:36:49,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 13:36:49,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:36:49,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:36:49,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 13:36:49,205 INFO L279 TraceCheckSpWp]: Computing forward predicates...