./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.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_floatingpointinfluence_no-floats_file-39.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 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:41:38,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:41:38,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:41:38,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:41:38,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:41:38,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:41:38,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:41:38,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:41:38,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:41:38,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:41:38,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:41:38,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:41:38,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:41:38,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:41:38,989 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:41:38,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:41:38,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:41:38,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:41:38,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:41:38,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:41:38,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:41:38,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:41:38,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:41:38,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:41:38,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:41:38,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:41:38,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:41:38,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:41:38,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:41:38,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:41:38,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:41:38,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:41:38,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:41:38,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:41:38,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:41:38,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:41:38,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:41:38,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:41:38,992 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 -> 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 [2025-01-09 12:41:39,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:41:39,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:41:39,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:41:39,255 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:41:39,256 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:41:39,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2025-01-09 12:41:40,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d840eaf2/0fd0fa3f9f4749caaa2f2d88feaacf8e/FLAG7ff8b1719 [2025-01-09 12:41:40,810 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:41:40,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2025-01-09 12:41:40,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d840eaf2/0fd0fa3f9f4749caaa2f2d88feaacf8e/FLAG7ff8b1719 [2025-01-09 12:41:41,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d840eaf2/0fd0fa3f9f4749caaa2f2d88feaacf8e [2025-01-09 12:41:41,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:41:41,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:41:41,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:41:41,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:41:41,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:41:41,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360e961e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41, skipping insertion in model container [2025-01-09 12:41:41,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:41:41,254 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2025-01-09 12:41:41,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:41:41,316 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:41:41,325 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2025-01-09 12:41:41,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:41:41,366 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:41:41,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41 WrapperNode [2025-01-09 12:41:41,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:41:41,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:41:41,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:41:41,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:41:41,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,413 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-01-09 12:41:41,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:41:41,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:41:41,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:41:41,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:41:41,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,444 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 12:41:41,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:41:41,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:41:41,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:41:41,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:41:41,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (1/1) ... [2025-01-09 12:41:41,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:41:41,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:41:41,496 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 12:41:41,498 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 12:41:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:41:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:41:41,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:41:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:41:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:41:41,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:41:41,572 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:41:41,573 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:41:41,843 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:41:41,843 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:41:41,851 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:41:41,851 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:41:41,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:41:41 BoogieIcfgContainer [2025-01-09 12:41:41,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:41:41,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:41:41,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:41:41,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:41:41,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:41:41" (1/3) ... [2025-01-09 12:41:41,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3966e1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:41:41, skipping insertion in model container [2025-01-09 12:41:41,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:41" (2/3) ... [2025-01-09 12:41:41,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3966e1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:41:41, skipping insertion in model container [2025-01-09 12:41:41,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:41:41" (3/3) ... [2025-01-09 12:41:41,860 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-39.i [2025-01-09 12:41:41,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:41:41,871 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-39.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:41:41,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:41:41,921 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;@b4ad0e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:41:41,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:41:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:41:41,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:41,932 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:41,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:41,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash -978011836, now seen corresponding path program 1 times [2025-01-09 12:41:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:41,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247237293] [2025-01-09 12:41:41,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:41,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:42,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:41:42,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:41:42,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:42,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 12:41:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:42,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247237293] [2025-01-09 12:41:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247237293] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:41:42,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081291079] [2025-01-09 12:41:42,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:42,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:41:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:41:42,178 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 12:41:42,179 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 12:41:42,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:41:42,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:41:42,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:42,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:42,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:41:42,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:41:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 12:41:42,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:41:42,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081291079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:42,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:41:42,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:41:42,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987829789] [2025-01-09 12:41:42,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:42,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:41:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:42,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:41:42,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:41:42,372 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 12:41:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:42,390 INFO L93 Difference]: Finished difference Result 110 states and 184 transitions. [2025-01-09 12:41:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:41:42,391 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2025-01-09 12:41:42,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:42,395 INFO L225 Difference]: With dead ends: 110 [2025-01-09 12:41:42,395 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 12:41:42,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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 12:41:42,400 INFO L435 NwaCegarLoop]: 80 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, 80 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 12:41:42,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:41:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 12:41:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 12:41:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2025-01-09 12:41:42,428 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 119 [2025-01-09 12:41:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:42,429 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2025-01-09 12:41:42,429 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 12:41:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2025-01-09 12:41:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:41:42,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:42,432 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:42,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:41:42,633 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 12:41:42,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:42,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2119513594, now seen corresponding path program 1 times [2025-01-09 12:41:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:42,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365226985] [2025-01-09 12:41:42,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:42,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:41:42,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:41:42,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:42,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:41:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365226985] [2025-01-09 12:41:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365226985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:43,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:43,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:41:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817121573] [2025-01-09 12:41:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:43,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:41:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:43,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:41:43,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:41:43,856 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:44,148 INFO L93 Difference]: Finished difference Result 127 states and 182 transitions. [2025-01-09 12:41:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:41:44,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 12:41:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:44,150 INFO L225 Difference]: With dead ends: 127 [2025-01-09 12:41:44,150 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 12:41:44,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:41:44,152 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:44,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 189 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:41:44,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 12:41:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2025-01-09 12:41:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2025-01-09 12:41:44,164 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 119 [2025-01-09 12:41:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:44,165 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2025-01-09 12:41:44,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2025-01-09 12:41:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 12:41:44,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:44,168 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:44,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:41:44,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:44,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1713884023, now seen corresponding path program 1 times [2025-01-09 12:41:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461003667] [2025-01-09 12:41:44,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:44,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 12:41:44,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 12:41:44,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:44,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:41:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461003667] [2025-01-09 12:41:45,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461003667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:45,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:45,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:41:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042551791] [2025-01-09 12:41:45,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:45,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:41:45,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:45,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:41:45,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:41:45,246 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:45,583 INFO L93 Difference]: Finished difference Result 152 states and 214 transitions. [2025-01-09 12:41:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:41:45,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2025-01-09 12:41:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:45,586 INFO L225 Difference]: With dead ends: 152 [2025-01-09 12:41:45,586 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 12:41:45,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:41:45,588 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 74 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:45,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 239 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:41:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 12:41:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 62. [2025-01-09 12:41:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2025-01-09 12:41:45,596 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 120 [2025-01-09 12:41:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:45,597 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2025-01-09 12:41:45,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2025-01-09 12:41:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 12:41:45,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:45,601 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:45,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:41:45,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:45,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2106911033, now seen corresponding path program 1 times [2025-01-09 12:41:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:45,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531698617] [2025-01-09 12:41:45,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:45,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 12:41:45,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 12:41:45,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:45,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:41:46,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:46,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531698617] [2025-01-09 12:41:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531698617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:46,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:46,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:41:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948325032] [2025-01-09 12:41:46,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:46,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:41:46,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:46,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:41:46,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:41:46,855 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:47,348 INFO L93 Difference]: Finished difference Result 141 states and 201 transitions. [2025-01-09 12:41:47,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:41:47,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2025-01-09 12:41:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:47,352 INFO L225 Difference]: With dead ends: 141 [2025-01-09 12:41:47,352 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 12:41:47,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:41:47,353 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 61 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:47,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 186 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:41:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 12:41:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2025-01-09 12:41:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2025-01-09 12:41:47,366 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 120 [2025-01-09 12:41:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:47,368 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2025-01-09 12:41:47,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2025-01-09 12:41:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 12:41:47,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:47,371 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:47,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:41:47,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:47,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1586522047, now seen corresponding path program 1 times [2025-01-09 12:41:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:47,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564614443] [2025-01-09 12:41:47,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:47,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:47,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 12:41:47,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 12:41:47,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:47,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:41:47,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:47,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564614443] [2025-01-09 12:41:47,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564614443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:47,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:47,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:41:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912478224] [2025-01-09 12:41:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:47,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:41:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:47,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:41:47,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:41:47,749 INFO L87 Difference]: Start difference. First operand 55 states and 79 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:47,913 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2025-01-09 12:41:47,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:41:47,914 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2025-01-09 12:41:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:47,916 INFO L225 Difference]: With dead ends: 76 [2025-01-09 12:41:47,918 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 12:41:47,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:41:47,919 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:47,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 497 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:41:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 12:41:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2025-01-09 12:41:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2025-01-09 12:41:47,933 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 121 [2025-01-09 12:41:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:47,934 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2025-01-09 12:41:47,934 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2025-01-09 12:41:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 12:41:47,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:47,935 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:47,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:41:47,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:47,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash -223550658, now seen corresponding path program 1 times [2025-01-09 12:41:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:47,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774484110] [2025-01-09 12:41:47,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:47,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 12:41:47,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 12:41:47,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:47,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:41:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:48,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774484110] [2025-01-09 12:41:48,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774484110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:48,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:48,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:41:48,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224952732] [2025-01-09 12:41:48,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:48,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:41:48,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:48,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:41:48,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:41:48,020 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:48,069 INFO L93 Difference]: Finished difference Result 138 states and 192 transitions. [2025-01-09 12:41:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:41:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2025-01-09 12:41:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:48,071 INFO L225 Difference]: With dead ends: 138 [2025-01-09 12:41:48,071 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 12:41:48,071 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 12:41:48,072 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:48,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:41:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 12:41:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2025-01-09 12:41:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-01-09 12:41:48,080 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 122 [2025-01-09 12:41:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:48,081 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-01-09 12:41:48,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-01-09 12:41:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 12:41:48,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:48,083 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:48,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:41:48,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:48,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash -46065536, now seen corresponding path program 1 times [2025-01-09 12:41:48,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:48,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280403027] [2025-01-09 12:41:48,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:48,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 12:41:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 12:41:48,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:48,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:41:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280403027] [2025-01-09 12:41:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280403027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:49,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:41:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279735970] [2025-01-09 12:41:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:49,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:41:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:49,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:41:49,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:41:49,186 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:49,719 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2025-01-09 12:41:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:41:49,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2025-01-09 12:41:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:49,723 INFO L225 Difference]: With dead ends: 80 [2025-01-09 12:41:49,723 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 12:41:49,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:41:49,724 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:49,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 551 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:41:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 12:41:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2025-01-09 12:41:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-01-09 12:41:49,733 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 122 [2025-01-09 12:41:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:49,736 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-01-09 12:41:49,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-01-09 12:41:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 12:41:49,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:49,738 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:49,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:41:49,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:49,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:49,738 INFO L85 PathProgramCache]: Analyzing trace with hash 633992834, now seen corresponding path program 1 times [2025-01-09 12:41:49,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:49,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632577784] [2025-01-09 12:41:49,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:49,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 12:41:49,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 12:41:49,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:49,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:41:50,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:50,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632577784] [2025-01-09 12:41:50,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632577784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:50,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:50,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:41:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157401987] [2025-01-09 12:41:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:50,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:41:50,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:50,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:41:50,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:41:50,266 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:50,586 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2025-01-09 12:41:50,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:41:50,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2025-01-09 12:41:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:50,587 INFO L225 Difference]: With dead ends: 77 [2025-01-09 12:41:50,588 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 12:41:50,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:41:50,589 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:50,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 551 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:41:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 12:41:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2025-01-09 12:41:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2025-01-09 12:41:50,594 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 122 [2025-01-09 12:41:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:50,595 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2025-01-09 12:41:50,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2025-01-09 12:41:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 12:41:50,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:50,596 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:50,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:41:50,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:50,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash -346761884, now seen corresponding path program 1 times [2025-01-09 12:41:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531752564] [2025-01-09 12:41:50,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:50,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 12:41:50,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 12:41:50,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:50,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:41:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531752564] [2025-01-09 12:41:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531752564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:41:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374052478] [2025-01-09 12:41:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:50,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:41:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:50,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:41:50,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:41:50,654 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:50,692 INFO L93 Difference]: Finished difference Result 130 states and 182 transitions. [2025-01-09 12:41:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:41:50,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2025-01-09 12:41:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:50,693 INFO L225 Difference]: With dead ends: 130 [2025-01-09 12:41:50,693 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 12:41:50,694 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 12:41:50,694 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:50,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 139 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:41:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 12:41:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2025-01-09 12:41:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2025-01-09 12:41:50,704 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 122 [2025-01-09 12:41:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:50,705 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-01-09 12:41:50,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:41:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2025-01-09 12:41:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 12:41:50,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:50,706 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:50,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:41:50,707 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:50,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:50,707 INFO L85 PathProgramCache]: Analyzing trace with hash -445691269, now seen corresponding path program 1 times [2025-01-09 12:41:50,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:50,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834105463] [2025-01-09 12:41:50,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:50,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:50,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:41:50,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:41:50,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:50,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:41:50,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1017330606] [2025-01-09 12:41:50,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:41:50,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:41:50,775 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 12:41:50,777 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 12:41:50,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:41:50,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:41:50,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:50,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:41:50,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:41:50,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 12:41:50,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 12:41:50,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:50,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:41:50,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:41:50,974 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:41:50,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:41:50,984 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 12:41:51,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:41:51,183 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:41:51,271 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:41:51,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:41:51 BoogieIcfgContainer [2025-01-09 12:41:51,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:41:51,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:41:51,279 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:41:51,279 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:41:51,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:41:41" (3/4) ... [2025-01-09 12:41:51,282 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:41:51,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:41:51,284 INFO L158 Benchmark]: Toolchain (without parser) took 10177.82ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 125.1MB in the beginning and 397.8MB in the end (delta: -272.7MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2025-01-09 12:41:51,284 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:41:51,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.69ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 113.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:41:51,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.31ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 111.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:41:51,285 INFO L158 Benchmark]: Boogie Preprocessor took 49.38ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 108.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:41:51,286 INFO L158 Benchmark]: RCFGBuilder took 387.68ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 92.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:41:51,286 INFO L158 Benchmark]: TraceAbstraction took 9424.64ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 91.5MB in the beginning and 397.9MB in the end (delta: -306.5MB). Peak memory consumption was 170.4MB. Max. memory is 16.1GB. [2025-01-09 12:41:51,286 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 444.6MB. Free memory was 397.9MB in the beginning and 397.8MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:41:51,288 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.69ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 113.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.31ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 111.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.38ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 108.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 387.68ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 92.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9424.64ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 91.5MB in the beginning and 397.9MB in the end (delta: -306.5MB). Peak memory consumption was 170.4MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 444.6MB. Free memory was 397.9MB in the beginning and 397.8MB in the end (delta: 75.1kB). 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 shiftLeft at line 92, overapproximation of shiftLeft at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] signed short int var_1_2 = 0; [L24] signed short int var_1_3 = 1000; [L25] signed short int var_1_4 = 10; [L26] signed short int var_1_5 = 32; [L27] signed long int var_1_6 = 5; [L28] signed long int var_1_7 = 1; [L29] signed long int var_1_8 = 7; [L30] signed long int var_1_9 = 1; [L31] signed long int var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] signed long int var_1_12 = 1230482582; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L96] isInitial = 1 [L97] FCALL initially() [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_short() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L62] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L62] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L63] var_1_3 = __VERIFIER_nondet_short() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L65] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L65] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L66] var_1_4 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L68] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L69] var_1_5 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L71] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L73] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L74] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L75] var_1_8 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L85] var_1_12 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L100] RET updateVariables() [L101] CALL step() [L37] var_1_1 = ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L38] COND FALSE !(var_1_2 >= var_1_1) [L45] var_1_6 = var_1_4 VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L47] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L47] signed long int stepLocal_1 = var_1_6 + (var_1_4 << var_1_2); [L48] signed long int stepLocal_0 = var_1_2 - (var_1_12 - var_1_5); VAL [isInitial=1, stepLocal_0=-1073741782, stepLocal_1=29, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L49] COND FALSE !(stepLocal_1 != var_1_5) [L56] var_1_10 = var_1_2 VAL [isInitial=1, stepLocal_0=-1073741782, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L92] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L92] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L92-L93] return ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 10, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 2559 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1881 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 975 IncrementalHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 678 mSDtfsCounter, 975 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=6, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 113 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1452 NumberOfCodeBlocks, 1452 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1196 ConstructedInterpolants, 0 QuantifiedInterpolants, 6959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6804/6840 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 12:41:51,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_floatingpointinfluence_no-floats_file-39.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 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:41:53,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:41:53,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:41:53,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:41:53,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:41:53,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:41:53,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:41:53,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:41:53,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:41:53,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:41:53,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:41:53,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:41:53,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:41:53,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:41:53,684 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:41:53,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:41:53,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:41:53,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:41:53,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:41:53,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:41:53,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:41:53,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:41:53,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:41:53,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:41:53,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:41:53,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:41:53,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:41:53,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:41:53,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:41:53,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:41:53,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:41:53,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:41:53,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:41:53,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:41:53,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:41:53,688 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:41:53,688 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:41:53,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:41:53,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:41:53,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:41:53,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:41:53,688 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 -> 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 [2025-01-09 12:41:53,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:41:53,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:41:53,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:41:53,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:41:53,989 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:41:53,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2025-01-09 12:41:55,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea10c04db/b1dd0ce12ffa4c0a97bd8f3676cb476f/FLAGd747b8e71 [2025-01-09 12:41:55,480 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:41:55,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2025-01-09 12:41:55,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea10c04db/b1dd0ce12ffa4c0a97bd8f3676cb476f/FLAGd747b8e71 [2025-01-09 12:41:55,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea10c04db/b1dd0ce12ffa4c0a97bd8f3676cb476f [2025-01-09 12:41:55,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:41:55,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:41:55,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:41:55,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:41:55,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:41:55,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:41:55" (1/1) ... [2025-01-09 12:41:55,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2924b362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:55, skipping insertion in model container [2025-01-09 12:41:55,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:41:55" (1/1) ... [2025-01-09 12:41:55,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:41:55,952 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2025-01-09 12:41:55,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:41:56,006 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:41:56,016 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2025-01-09 12:41:56,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:41:56,060 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:41:56,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56 WrapperNode [2025-01-09 12:41:56,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:41:56,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:41:56,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:41:56,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:41:56,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,103 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-01-09 12:41:56,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:41:56,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:41:56,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:41:56,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:41:56,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,138 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 12:41:56,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:41:56,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:41:56,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:41:56,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:41:56,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (1/1) ... [2025-01-09 12:41:56,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:41:56,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:41:56,207 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 12:41:56,209 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 12:41:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:41:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:41:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:41:56,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:41:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:41:56,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:41:56,284 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:41:56,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:41:56,505 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:41:56,505 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:41:56,512 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:41:56,513 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:41:56,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:41:56 BoogieIcfgContainer [2025-01-09 12:41:56,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:41:56,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:41:56,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:41:56,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:41:56,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:41:55" (1/3) ... [2025-01-09 12:41:56,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d994669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:41:56, skipping insertion in model container [2025-01-09 12:41:56,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:41:56" (2/3) ... [2025-01-09 12:41:56,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d994669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:41:56, skipping insertion in model container [2025-01-09 12:41:56,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:41:56" (3/3) ... [2025-01-09 12:41:56,521 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-39.i [2025-01-09 12:41:56,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:41:56,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-39.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:41:56,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:41:56,599 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;@53c62b7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:41:56,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:41:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 12:41:56,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:56,612 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:56,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:56,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1282004013, now seen corresponding path program 1 times [2025-01-09 12:41:56,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:41:56,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195176889] [2025-01-09 12:41:56,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:56,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:41:56,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:41:56,626 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 12:41:56,628 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 12:41:56,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 12:41:56,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 12:41:56,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:56,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:56,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:41:56,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:41:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 12:41:56,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:41:56,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:41:56,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195176889] [2025-01-09 12:41:56,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195176889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:56,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:56,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:41:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334034239] [2025-01-09 12:41:56,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:56,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:41:56,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:41:56,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:41:56,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:41:56,831 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 12:41:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:56,856 INFO L93 Difference]: Finished difference Result 96 states and 164 transitions. [2025-01-09 12:41:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:41:56,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2025-01-09 12:41:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:56,864 INFO L225 Difference]: With dead ends: 96 [2025-01-09 12:41:56,864 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 12:41:56,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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 12:41:56,871 INFO L435 NwaCegarLoop]: 70 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, 70 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 12:41:56,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:41:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 12:41:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 12:41:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:41:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2025-01-09 12:41:56,924 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 116 [2025-01-09 12:41:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:56,924 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2025-01-09 12:41:56,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 12:41:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2025-01-09 12:41:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 12:41:56,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:56,927 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:56,935 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 12:41:57,128 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 [2025-01-09 12:41:57,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:57,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1944214959, now seen corresponding path program 1 times [2025-01-09 12:41:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:41:57,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305919428] [2025-01-09 12:41:57,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:57,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:41:57,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:41:57,132 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 12:41:57,133 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 12:41:57,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 12:41:57,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 12:41:57,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:57,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:57,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 12:41:57,271 INFO L279 TraceCheckSpWp]: Computing forward predicates...