./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.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 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:57:29,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:57:29,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:57:29,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:57:29,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:57:29,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:57:29,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:57:29,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:57:29,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:57:29,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:57:29,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:57:29,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:57:29,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:57:29,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:57:29,815 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:57:29,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:57:29,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:57:29,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:57:29,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:57:29,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:57:29,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:57:29,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:57:29,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:57:29,818 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 -> 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e [2025-01-09 13:57:30,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:57:30,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:57:30,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:57:30,013 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:57:30,013 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:57:30,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2025-01-09 13:57:31,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/642441254/6f92a1b3dbf54efbaa0619784dd1da9c/FLAGeb57060bc [2025-01-09 13:57:31,304 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:57:31,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2025-01-09 13:57:31,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/642441254/6f92a1b3dbf54efbaa0619784dd1da9c/FLAGeb57060bc [2025-01-09 13:57:31,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/642441254/6f92a1b3dbf54efbaa0619784dd1da9c [2025-01-09 13:57:31,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:57:31,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:57:31,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:57:31,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:57:31,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:57:31,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31, skipping insertion in model container [2025-01-09 13:57:31,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:57:31,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i[915,928] [2025-01-09 13:57:31,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:57:31,758 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:57:31,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i[915,928] [2025-01-09 13:57:31,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:57:31,790 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:57:31,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31 WrapperNode [2025-01-09 13:57:31,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:57:31,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:57:31,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:57:31,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:57:31,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,815 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-01-09 13:57:31,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:57:31,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:57:31,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:57:31,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:57:31,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,836 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:57:31,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:57:31,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:57:31,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:57:31,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:57:31,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (1/1) ... [2025-01-09 13:57:31,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:57:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:57:31,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:57:31,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:57:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:57:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:57:31,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:57:31,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:57:31,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:57:31,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:57:31,931 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:57:31,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:57:32,118 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 13:57:32,119 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:57:32,125 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:57:32,125 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:57:32,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:57:32 BoogieIcfgContainer [2025-01-09 13:57:32,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:57:32,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:57:32,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:57:32,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:57:32,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:57:31" (1/3) ... [2025-01-09 13:57:32,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6256ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:57:32, skipping insertion in model container [2025-01-09 13:57:32,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:57:31" (2/3) ... [2025-01-09 13:57:32,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6256ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:57:32, skipping insertion in model container [2025-01-09 13:57:32,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:57:32" (3/3) ... [2025-01-09 13:57:32,131 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-66.i [2025-01-09 13:57:32,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:57:32,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-66.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:57:32,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:57:32,183 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;@1ad2da3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:57:32,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:57:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:57:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:57:32,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:57:32,192 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:57:32,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:57:32,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:57:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1974806305, now seen corresponding path program 1 times [2025-01-09 13:57:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:57:32,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875229017] [2025-01-09 13:57:32,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:57:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:57:32,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:57:32,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:57:32,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:57:32,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:57:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:57:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:57:32,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875229017] [2025-01-09 13:57:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875229017] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:57:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376588860] [2025-01-09 13:57:32,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:57:32,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:57:32,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:57:32,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:57:32,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:57:32,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:57:32,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:57:32,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:57:32,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:57:32,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:57:32,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:57:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:57:32,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:57:32,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376588860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:57:32,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:57:32,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:57:32,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143215293] [2025-01-09 13:57:32,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:57:32,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:57:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:57:32,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:57:32,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:57:32,614 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:57:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:57:32,634 INFO L93 Difference]: Finished difference Result 114 states and 195 transitions. [2025-01-09 13:57:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:57:32,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-01-09 13:57:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:57:32,640 INFO L225 Difference]: With dead ends: 114 [2025-01-09 13:57:32,640 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 13:57:32,643 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 13:57:32,646 INFO L435 NwaCegarLoop]: 86 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, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:57:32,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:57:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 13:57:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 13:57:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:57:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-01-09 13:57:32,680 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 119 [2025-01-09 13:57:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:57:32,681 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-01-09 13:57:32,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:57:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-01-09 13:57:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:57:32,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:57:32,686 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:57:32,692 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 13:57:32,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:57:32,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:57:32,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:57:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1569859681, now seen corresponding path program 1 times [2025-01-09 13:57:32,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:57:32,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873549905] [2025-01-09 13:57:32,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:57:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:57:32,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:57:33,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:57:33,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:57:33,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:57:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:57:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:57:37,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873549905] [2025-01-09 13:57:37,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873549905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:57:37,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:57:37,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 13:57:37,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674426983] [2025-01-09 13:57:37,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:57:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:57:37,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:57:37,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:57:37,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:57:37,335 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:57:38,050 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-01-09 13:57:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:57:38,051 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:57:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:57:38,053 INFO L225 Difference]: With dead ends: 232 [2025-01-09 13:57:38,053 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 13:57:38,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:57:38,054 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 238 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:57:38,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 428 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:57:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 13:57:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 102. [2025-01-09 13:57:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:57:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2025-01-09 13:57:38,066 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2025-01-09 13:57:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:57:38,066 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2025-01-09 13:57:38,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2025-01-09 13:57:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:57:38,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:57:38,068 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:57:38,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:57:38,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:57:38,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:57:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1571706723, now seen corresponding path program 1 times [2025-01-09 13:57:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:57:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441132509] [2025-01-09 13:57:38,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:57:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:57:38,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:57:38,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:57:38,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:57:38,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:57:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:57:42,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:57:42,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441132509] [2025-01-09 13:57:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441132509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:57:42,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:57:42,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 13:57:42,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958930662] [2025-01-09 13:57:42,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:57:42,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 13:57:42,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:57:42,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 13:57:42,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:57:42,102 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:57:43,583 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2025-01-09 13:57:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:57:43,584 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:57:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:57:43,585 INFO L225 Difference]: With dead ends: 178 [2025-01-09 13:57:43,586 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 13:57:43,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 13:57:43,586 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 199 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 13:57:43,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 561 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 13:57:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 13:57:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 102. [2025-01-09 13:57:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:57:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2025-01-09 13:57:43,611 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2025-01-09 13:57:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:57:43,611 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2025-01-09 13:57:43,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2025-01-09 13:57:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:57:43,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:57:43,612 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:57:43,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:57:43,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:57:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:57:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 889801311, now seen corresponding path program 1 times [2025-01-09 13:57:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:57:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467560650] [2025-01-09 13:57:43,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:57:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:57:43,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:57:43,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:57:43,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:57:43,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:57:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:57:45,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:57:45,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467560650] [2025-01-09 13:57:45,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467560650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:57:45,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:57:45,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 13:57:45,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173956898] [2025-01-09 13:57:45,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:57:45,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:57:45,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:57:45,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:57:45,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:57:45,599 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:57:46,317 INFO L93 Difference]: Finished difference Result 185 states and 250 transitions. [2025-01-09 13:57:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:57:46,317 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:57:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:57:46,319 INFO L225 Difference]: With dead ends: 185 [2025-01-09 13:57:46,319 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 13:57:46,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:57:46,320 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:57:46,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 557 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:57:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 13:57:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2025-01-09 13:57:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:57:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2025-01-09 13:57:46,329 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 119 [2025-01-09 13:57:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:57:46,329 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2025-01-09 13:57:46,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2025-01-09 13:57:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:57:46,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:57:46,330 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:57:46,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:57:46,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:57:46,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:57:46,331 INFO L85 PathProgramCache]: Analyzing trace with hash 891648353, now seen corresponding path program 1 times [2025-01-09 13:57:46,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:57:46,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788637945] [2025-01-09 13:57:46,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:57:46,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:57:46,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:57:46,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:57:46,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:57:46,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:57:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:57:48,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:57:48,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788637945] [2025-01-09 13:57:48,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788637945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:57:48,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:57:48,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 13:57:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038308190] [2025-01-09 13:57:48,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:57:48,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 13:57:48,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:57:48,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 13:57:48,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:57:48,952 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:57:50,524 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2025-01-09 13:57:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:57:50,525 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:57:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:57:50,526 INFO L225 Difference]: With dead ends: 183 [2025-01-09 13:57:50,526 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 13:57:50,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 13:57:50,528 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 159 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:57:50,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 542 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:57:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 13:57:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 102. [2025-01-09 13:57:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:57:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2025-01-09 13:57:50,541 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2025-01-09 13:57:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:57:50,541 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2025-01-09 13:57:50,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2025-01-09 13:57:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:57:50,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:57:50,543 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:57:50,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:57:50,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:57:50,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:57:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1828025119, now seen corresponding path program 1 times [2025-01-09 13:57:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:57:50,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842853245] [2025-01-09 13:57:50,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:57:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:57:50,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:57:50,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:57:50,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:57:50,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:57:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:57:50,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:57:50,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842853245] [2025-01-09 13:57:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842853245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:57:50,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:57:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:57:50,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644893468] [2025-01-09 13:57:50,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:57:50,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:57:50,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:57:50,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:57:50,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:57:50,577 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:57:50,603 INFO L93 Difference]: Finished difference Result 281 states and 422 transitions. [2025-01-09 13:57:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:57:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:57:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:57:50,605 INFO L225 Difference]: With dead ends: 281 [2025-01-09 13:57:50,605 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 13:57:50,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:57:50,606 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:57:50,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:57:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 13:57:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-01-09 13:57:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 133 states have internal predecessors, (174), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 13:57:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2025-01-09 13:57:50,620 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 119 [2025-01-09 13:57:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:57:50,621 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2025-01-09 13:57:50,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:57:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2025-01-09 13:57:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:57:50,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:57:50,622 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:57:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:57:50,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:57:50,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:57:50,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1018678493, now seen corresponding path program 1 times [2025-01-09 13:57:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:57:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070270828] [2025-01-09 13:57:50,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:57:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:57:50,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:57:50,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:57:50,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:57:50,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:58:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:58:09,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:58:09,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070270828] [2025-01-09 13:58:09,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070270828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:58:09,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:58:09,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 13:58:09,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574651534] [2025-01-09 13:58:09,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:58:09,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:58:09,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:58:09,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:58:09,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:58:09,428 INFO L87 Difference]: Start difference. First operand 180 states and 262 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:58:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:58:11,476 INFO L93 Difference]: Finished difference Result 425 states and 582 transitions. [2025-01-09 13:58:11,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 13:58:11,476 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:58:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:58:11,479 INFO L225 Difference]: With dead ends: 425 [2025-01-09 13:58:11,479 INFO L226 Difference]: Without dead ends: 423 [2025-01-09 13:58:11,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2025-01-09 13:58:11,481 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 327 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 13:58:11,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 469 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 13:58:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-01-09 13:58:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 337. [2025-01-09 13:58:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 239 states have (on average 1.297071129707113) internal successors, (310), 243 states have internal predecessors, (310), 88 states have call successors, (88), 9 states have call predecessors, (88), 9 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 13:58:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 486 transitions. [2025-01-09 13:58:11,524 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 486 transitions. Word has length 119 [2025-01-09 13:58:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:58:11,525 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 486 transitions. [2025-01-09 13:58:11,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:58:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 486 transitions. [2025-01-09 13:58:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:58:11,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:58:11,526 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:58:11,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:58:11,526 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:58:11,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:58:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1020525535, now seen corresponding path program 1 times [2025-01-09 13:58:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:58:11,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403242170] [2025-01-09 13:58:11,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:11,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:58:11,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:58:11,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:58:11,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:11,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:58:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:58:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:58:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403242170] [2025-01-09 13:58:14,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403242170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:58:14,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:58:14,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 13:58:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089974857] [2025-01-09 13:58:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:58:14,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:58:14,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:58:14,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:58:14,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:58:14,190 INFO L87 Difference]: Start difference. First operand 337 states and 486 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:58:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:58:15,854 INFO L93 Difference]: Finished difference Result 423 states and 580 transitions. [2025-01-09 13:58:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 13:58:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:58:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:58:15,857 INFO L225 Difference]: With dead ends: 423 [2025-01-09 13:58:15,857 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 13:58:15,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:58:15,858 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 279 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:58:15,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 581 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 13:58:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 13:58:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 337. [2025-01-09 13:58:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 239 states have (on average 1.297071129707113) internal successors, (310), 243 states have internal predecessors, (310), 88 states have call successors, (88), 9 states have call predecessors, (88), 9 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 13:58:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 486 transitions. [2025-01-09 13:58:15,894 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 486 transitions. Word has length 119 [2025-01-09 13:58:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:58:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 486 transitions. [2025-01-09 13:58:15,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:58:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 486 transitions. [2025-01-09 13:58:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:58:15,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:58:15,896 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:58:15,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:58:15,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:58:15,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:58:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash 338620123, now seen corresponding path program 1 times [2025-01-09 13:58:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:58:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830466478] [2025-01-09 13:58:15,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:58:15,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:58:15,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:58:15,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:15,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:58:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:58:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:58:15,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830466478] [2025-01-09 13:58:15,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830466478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:58:15,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:58:15,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:58:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031556156] [2025-01-09 13:58:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:58:15,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:58:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:58:15,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:58:15,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:58:15,986 INFO L87 Difference]: Start difference. First operand 337 states and 486 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:58:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:58:16,205 INFO L93 Difference]: Finished difference Result 699 states and 987 transitions. [2025-01-09 13:58:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:58:16,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:58:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:58:16,208 INFO L225 Difference]: With dead ends: 699 [2025-01-09 13:58:16,208 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 13:58:16,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:58:16,210 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 67 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:58:16,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 275 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:58:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 13:58:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 364. [2025-01-09 13:58:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 265 states have internal predecessors, (332), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 13:58:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 516 transitions. [2025-01-09 13:58:16,239 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 516 transitions. Word has length 119 [2025-01-09 13:58:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:58:16,239 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 516 transitions. [2025-01-09 13:58:16,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:58:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 516 transitions. [2025-01-09 13:58:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:58:16,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:58:16,241 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:58:16,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 13:58:16,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:58:16,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:58:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash 983053667, now seen corresponding path program 1 times [2025-01-09 13:58:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:58:16,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371849315] [2025-01-09 13:58:16,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:58:16,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:58:16,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:58:16,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:16,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:58:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:58:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:58:16,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371849315] [2025-01-09 13:58:16,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371849315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:58:16,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:58:16,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:58:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636730239] [2025-01-09 13:58:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:58:16,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:58:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:58:16,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:58:16,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:58:16,393 INFO L87 Difference]: Start difference. First operand 364 states and 516 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:58:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:58:16,570 INFO L93 Difference]: Finished difference Result 689 states and 965 transitions. [2025-01-09 13:58:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:58:16,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-01-09 13:58:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:58:16,573 INFO L225 Difference]: With dead ends: 689 [2025-01-09 13:58:16,573 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 13:58:16,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:58:16,573 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 125 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:58:16,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 166 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:58:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 13:58:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 362. [2025-01-09 13:58:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 252 states have (on average 1.2341269841269842) internal successors, (311), 257 states have internal predecessors, (311), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 13:58:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 503 transitions. [2025-01-09 13:58:16,606 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 503 transitions. Word has length 119 [2025-01-09 13:58:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:58:16,607 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 503 transitions. [2025-01-09 13:58:16,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:58:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 503 transitions. [2025-01-09 13:58:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 13:58:16,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:58:16,609 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:58:16,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:58:16,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:58:16,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:58:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1615299120, now seen corresponding path program 1 times [2025-01-09 13:58:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:58:16,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550097973] [2025-01-09 13:58:16,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:58:16,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 13:58:16,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 13:58:16,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:16,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:58:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384591451] [2025-01-09 13:58:16,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:16,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:58:16,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:58:16,649 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:58:16,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:58:16,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 13:58:17,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 13:58:17,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:17,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:58:17,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 13:58:17,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:58:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 371 proven. 144 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-01-09 13:58:19,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:58:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:58:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550097973] [2025-01-09 13:58:49,520 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 13:58:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384591451] [2025-01-09 13:58:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384591451] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:58:49,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:58:49,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2025-01-09 13:58:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536548187] [2025-01-09 13:58:49,520 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 13:58:49,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 13:58:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:58:49,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 13:58:49,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1130, Unknown=2, NotChecked=0, Total=1406 [2025-01-09 13:58:49,522 INFO L87 Difference]: Start difference. First operand 362 states and 503 transitions. Second operand has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 25 states have internal predecessors, (60), 7 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-01-09 13:59:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:00,704 INFO L93 Difference]: Finished difference Result 943 states and 1146 transitions. [2025-01-09 13:59:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-01-09 13:59:00,705 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 25 states have internal predecessors, (60), 7 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 120 [2025-01-09 13:59:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:00,708 INFO L225 Difference]: With dead ends: 943 [2025-01-09 13:59:00,708 INFO L226 Difference]: Without dead ends: 763 [2025-01-09 13:59:00,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2876 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=1909, Invalid=7790, Unknown=3, NotChecked=0, Total=9702 [2025-01-09 13:59:00,712 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 377 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:00,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 474 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 13:59:00,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-01-09 13:59:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 433. [2025-01-09 13:59:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 310 states have (on average 1.1870967741935483) internal successors, (368), 313 states have internal predecessors, (368), 84 states have call successors, (84), 38 states have call predecessors, (84), 38 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 13:59:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 536 transitions. [2025-01-09 13:59:00,764 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 536 transitions. Word has length 120 [2025-01-09 13:59:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:00,764 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 536 transitions. [2025-01-09 13:59:00,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 25 states have internal predecessors, (60), 7 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-01-09 13:59:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 536 transitions. [2025-01-09 13:59:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 13:59:00,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:00,765 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:59:00,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:59:00,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:59:00,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:00,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1617146162, now seen corresponding path program 1 times [2025-01-09 13:59:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:00,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468756416] [2025-01-09 13:59:00,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:00,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 13:59:00,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 13:59:00,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:00,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:59:01,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860784149] [2025-01-09 13:59:01,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:01,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:59:01,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:59:01,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:59:01,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 13:59:01,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 13:59:01,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 13:59:01,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:01,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:59:01,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:59:01,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 13:59:01,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 13:59:01,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:01,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:59:01,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:59:01,187 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:59:01,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:59:01,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 13:59:01,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:59:01,391 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:59:01,448 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:59:01,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:59:01 BoogieIcfgContainer [2025-01-09 13:59:01,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:59:01,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:59:01,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:59:01,451 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:59:01,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:57:32" (3/4) ... [2025-01-09 13:59:01,453 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:59:01,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:59:01,454 INFO L158 Benchmark]: Toolchain (without parser) took 89847.77ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 105.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. [2025-01-09 13:59:01,454 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:59:01,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.40ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:59:01,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.65ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:59:01,454 INFO L158 Benchmark]: Boogie Preprocessor took 32.58ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:59:01,455 INFO L158 Benchmark]: RCFGBuilder took 276.58ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 65.3MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:59:01,455 INFO L158 Benchmark]: TraceAbstraction took 89323.31ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 65.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2025-01-09 13:59:01,455 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 470.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:59:01,456 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.40ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.65ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.58ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 276.58ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 65.3MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 89323.31ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 65.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 470.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L124] isInitial = 1 [L125] FCALL initially() [L127] CALL updateLastVariables() [L117] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L92] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L95] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L96] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L96] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L99] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L99] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L101] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L102] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L102] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L104] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L106] var_1_14 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L107] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L108] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L108] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L109] var_1_20 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L111] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L111] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L112] var_1_21 = __VERIFIER_nondet_short() [L113] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L113] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L114] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L114] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L128] RET updateVariables() [L129] CALL step() [L43] signed char stepLocal_1 = var_1_6; [L44] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=-1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L45] COND FALSE !(-25 == stepLocal_1) [L50] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=49151] [L52] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=0, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=49151] [L53] COND TRUE var_1_8 >= stepLocal_2 [L54] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=49151] [L56] COND TRUE \read(var_1_12) [L57] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=49151] [L59] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=49151] [L60] COND TRUE \read(var_1_12) [L61] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] [L64] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=-1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] [L65] COND FALSE !(var_1_1 < stepLocal_4) [L68] var_1_18 = (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-2, var_1_19=25, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] [L70] COND TRUE \read(var_1_12) [L71] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-2, var_1_19=-64, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] [L73] COND TRUE -64 > (var_1_6 + var_1_19) [L74] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-2, var_1_19=-64, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] [L82] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=49152, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-2, var_1_19=-64, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] [L83] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-2, var_1_19=-64, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-2, var_1_19=-64, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-2, var_1_19=-64, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=-16386, var_1_11=-16385, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-2, var_1_19=-64, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_3=0, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=49151] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 89.2s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2012 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2004 mSDsluCounter, 4361 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3342 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4177 IncrementalHoareTripleChecker+Invalid, 4412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 1019 mSDtfsCounter, 4177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 34.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=433occurred in iteration=11, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 858 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 67.0s InterpolantComputationTime, 1789 NumberOfCodeBlocks, 1789 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1417 ConstructedInterpolants, 1 QuantifiedInterpolants, 15696 SizeOfPredicates, 13 NumberOfNonLiveVariables, 575 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 7166/7344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 13:59:01,665 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-09 13:59:01,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.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 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:59:03,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:59:03,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:59:03,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:59:03,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:59:03,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:59:03,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:59:03,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:59:03,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:59:03,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:59:03,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:59:03,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:59:03,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:59:03,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:59:03,715 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:59:03,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:59:03,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:59:03,716 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:59:03,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:59:03,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:59:03,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:59:03,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:59:03,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:59:03,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:59:03,717 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:59:03,718 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:59:03,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:59:03,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:59:03,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:59:03,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:59:03,718 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 -> 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e [2025-01-09 13:59:03,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:59:03,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:59:03,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:59:03,967 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:59:03,967 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:59:03,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2025-01-09 13:59:05,161 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad2994579/1c3fbd59f070442790c7f895fee4c131/FLAG74b9ea1f4