./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.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 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:46:41,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:46:41,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:46:41,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:46:41,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:46:41,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:46:41,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:46:41,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:46:41,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:46:41,854 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:46:41,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:46:41,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:46:41,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:46:41,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:46:41,855 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:46:41,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:46:41,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:46:41,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:41,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:41,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:41,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:41,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:46:41,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:41,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:41,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:41,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:41,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:46:41,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:46:41,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:46:41,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:46:41,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:46:41,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:46:41,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:46:41,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:46:41,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:46:41,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:46:41,858 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 -> 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 [2025-01-09 12:46:42,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:46:42,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:46:42,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:46:42,077 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:46:42,077 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:46:42,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2025-01-09 12:46:43,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46f06633/d1c292f532774e8eb1735c809b98df5f/FLAG1411b047d [2025-01-09 12:46:43,641 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:46:43,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2025-01-09 12:46:43,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46f06633/d1c292f532774e8eb1735c809b98df5f/FLAG1411b047d [2025-01-09 12:46:43,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46f06633/d1c292f532774e8eb1735c809b98df5f [2025-01-09 12:46:43,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:46:43,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:46:43,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:43,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:46:43,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:46:43,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:43" (1/1) ... [2025-01-09 12:46:43,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123cf036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:43, skipping insertion in model container [2025-01-09 12:46:43,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:43" (1/1) ... [2025-01-09 12:46:43,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:46:44,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i[916,929] [2025-01-09 12:46:44,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:44,045 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:46:44,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i[916,929] [2025-01-09 12:46:44,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:44,093 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:46:44,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44 WrapperNode [2025-01-09 12:46:44,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:44,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:44,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:46:44,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:46:44,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,135 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-01-09 12:46:44,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:44,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:46:44,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:46:44,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:46:44,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,165 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:46:44,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:46:44,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:46:44,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:46:44,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:46:44,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (1/1) ... [2025-01-09 12:46:44,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:44,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:44,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:46:44,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:46:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:46:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:46:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:46:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:46:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:46:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:46:44,295 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:46:44,297 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:46:44,517 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 12:46:44,518 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:46:44,526 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:46:44,527 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:46:44,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:44 BoogieIcfgContainer [2025-01-09 12:46:44,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:46:44,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:46:44,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:46:44,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:46:44,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:46:43" (1/3) ... [2025-01-09 12:46:44,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2725b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:44, skipping insertion in model container [2025-01-09 12:46:44,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:44" (2/3) ... [2025-01-09 12:46:44,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2725b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:44, skipping insertion in model container [2025-01-09 12:46:44,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:44" (3/3) ... [2025-01-09 12:46:44,536 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-83.i [2025-01-09 12:46:44,547 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:46:44,548 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-83.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:46:44,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:46:44,603 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;@1417540c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:46:44,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:46:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 12:46:44,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:44,613 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:44,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:44,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash 147017822, now seen corresponding path program 1 times [2025-01-09 12:46:44,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:44,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533330732] [2025-01-09 12:46:44,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:44,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:44,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 12:46:44,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 12:46:44,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:44,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 12:46:44,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:44,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533330732] [2025-01-09 12:46:44,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533330732] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:46:44,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009860038] [2025-01-09 12:46:44,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:44,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:44,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:44,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:44,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:46:44,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 12:46:44,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 12:46:44,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:44,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:44,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:46:44,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 12:46:44,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:44,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009860038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:44,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:46:44,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:46:44,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898545280] [2025-01-09 12:46:44,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:46:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:44,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:46:44,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:46:44,924 INFO L87 Difference]: Start difference. First operand has 57 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 12:46:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:44,937 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2025-01-09 12:46:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:46:44,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2025-01-09 12:46:44,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:44,942 INFO L225 Difference]: With dead ends: 108 [2025-01-09 12:46:44,942 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 12:46:44,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:46:44,946 INFO L435 NwaCegarLoop]: 78 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, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:44,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 12:46:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 12:46:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-01-09 12:46:44,985 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 88 [2025-01-09 12:46:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:44,985 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-01-09 12:46:44,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 12:46:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-01-09 12:46:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 12:46:44,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:44,987 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:44,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:46:45,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:46:45,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:45,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash 103196770, now seen corresponding path program 1 times [2025-01-09 12:46:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451910370] [2025-01-09 12:46:45,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:45,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:45,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 12:46:45,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 12:46:45,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:45,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:45,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451910370] [2025-01-09 12:46:45,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451910370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:45,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:45,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:46:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188540837] [2025-01-09 12:46:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:45,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:46:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:45,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:46:45,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:45,351 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:45,383 INFO L93 Difference]: Finished difference Result 130 states and 190 transitions. [2025-01-09 12:46:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:46:45,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2025-01-09 12:46:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:45,384 INFO L225 Difference]: With dead ends: 130 [2025-01-09 12:46:45,384 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 12:46:45,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:45,385 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:45,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 140 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 12:46:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2025-01-09 12:46:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2025-01-09 12:46:45,397 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 88 [2025-01-09 12:46:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:45,398 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2025-01-09 12:46:45,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2025-01-09 12:46:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 12:46:45,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:45,401 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:45,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:46:45,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:45,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash -230256650, now seen corresponding path program 1 times [2025-01-09 12:46:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:45,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497293412] [2025-01-09 12:46:45,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:45,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:45,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 12:46:45,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 12:46:45,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:45,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:45,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497293412] [2025-01-09 12:46:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497293412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:45,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:45,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:46:45,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365401623] [2025-01-09 12:46:45,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:45,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:46:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:45,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:46:45,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:46:45,536 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:45,575 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2025-01-09 12:46:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:46:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2025-01-09 12:46:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:45,577 INFO L225 Difference]: With dead ends: 107 [2025-01-09 12:46:45,577 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 12:46:45,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:46:45,578 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:45,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 193 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 12:46:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 12:46:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2025-01-09 12:46:45,582 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 89 [2025-01-09 12:46:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:45,583 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2025-01-09 12:46:45,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:45,583 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2025-01-09 12:46:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 12:46:45,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:45,584 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:45,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:46:45,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:45,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1600123586, now seen corresponding path program 1 times [2025-01-09 12:46:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:45,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530603896] [2025-01-09 12:46:45,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:45,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 12:46:45,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 12:46:45,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:45,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530603896] [2025-01-09 12:46:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530603896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:47,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:47,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:46:47,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286437097] [2025-01-09 12:46:47,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:47,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:46:47,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:47,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:46:47,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:46:47,447 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:47,675 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2025-01-09 12:46:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:46:47,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2025-01-09 12:46:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:47,676 INFO L225 Difference]: With dead ends: 140 [2025-01-09 12:46:47,676 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 12:46:47,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:46:47,679 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 96 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:47,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 174 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:46:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 12:46:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2025-01-09 12:46:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2025-01-09 12:46:47,686 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 90 [2025-01-09 12:46:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:47,686 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2025-01-09 12:46:47,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2025-01-09 12:46:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 12:46:47,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:47,687 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:47,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:46:47,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:47,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1637659256, now seen corresponding path program 1 times [2025-01-09 12:46:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:47,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880330163] [2025-01-09 12:46:47,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:47,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 12:46:47,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 12:46:47,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:47,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880330163] [2025-01-09 12:46:48,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880330163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:48,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:48,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:46:48,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891535555] [2025-01-09 12:46:48,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:48,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:46:48,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:48,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:46:48,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:46:48,433 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:48,692 INFO L93 Difference]: Finished difference Result 170 states and 228 transitions. [2025-01-09 12:46:48,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:46:48,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-01-09 12:46:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:48,694 INFO L225 Difference]: With dead ends: 170 [2025-01-09 12:46:48,694 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 12:46:48,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:46:48,695 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:48,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 296 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:46:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 12:46:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2025-01-09 12:46:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2025-01-09 12:46:48,701 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 91 [2025-01-09 12:46:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:48,701 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2025-01-09 12:46:48,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2025-01-09 12:46:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 12:46:48,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:48,702 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:48,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:46:48,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:48,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:48,703 INFO L85 PathProgramCache]: Analyzing trace with hash 626542006, now seen corresponding path program 1 times [2025-01-09 12:46:48,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:48,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209592789] [2025-01-09 12:46:48,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:48,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 12:46:48,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 12:46:48,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:48,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209592789] [2025-01-09 12:46:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209592789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:50,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:50,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:46:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977306927] [2025-01-09 12:46:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:50,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:46:50,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:50,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:46:50,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:46:50,250 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:51,289 INFO L93 Difference]: Finished difference Result 169 states and 226 transitions. [2025-01-09 12:46:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:46:51,292 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-01-09 12:46:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:51,295 INFO L225 Difference]: With dead ends: 169 [2025-01-09 12:46:51,295 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 12:46:51,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:46:51,297 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 43 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:51,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 370 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:46:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 12:46:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 60. [2025-01-09 12:46:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2025-01-09 12:46:51,315 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 91 [2025-01-09 12:46:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:51,315 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2025-01-09 12:46:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2025-01-09 12:46:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 12:46:51,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:51,316 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:46:51,316 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:51,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:51,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1509264133, now seen corresponding path program 1 times [2025-01-09 12:46:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:51,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835012519] [2025-01-09 12:46:51,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:51,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 12:46:51,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 12:46:51,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:51,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:51,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835012519] [2025-01-09 12:46:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835012519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:46:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910146903] [2025-01-09 12:46:51,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:51,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:46:51,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:51,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:46:51,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:51,367 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:51,418 INFO L93 Difference]: Finished difference Result 138 states and 181 transitions. [2025-01-09 12:46:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:46:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-01-09 12:46:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:51,419 INFO L225 Difference]: With dead ends: 138 [2025-01-09 12:46:51,419 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 12:46:51,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:51,420 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 27 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:51,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 113 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 12:46:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2025-01-09 12:46:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-01-09 12:46:51,424 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 92 [2025-01-09 12:46:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:51,425 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-01-09 12:46:51,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-01-09 12:46:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 12:46:51,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:51,425 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:51,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:46:51,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:51,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:51,426 INFO L85 PathProgramCache]: Analyzing trace with hash 390363780, now seen corresponding path program 1 times [2025-01-09 12:46:51,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:51,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031244057] [2025-01-09 12:46:51,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:51,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:51,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 12:46:51,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 12:46:51,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:51,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:51,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:51,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031244057] [2025-01-09 12:46:51,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031244057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:51,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:46:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360520531] [2025-01-09 12:46:51,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:51,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:46:51,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:51,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:46:51,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:46:51,607 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:51,793 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2025-01-09 12:46:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:46:51,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-01-09 12:46:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:51,794 INFO L225 Difference]: With dead ends: 127 [2025-01-09 12:46:51,795 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 12:46:51,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:46:51,795 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 90 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:51,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 412 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:46:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 12:46:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 92. [2025-01-09 12:46:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:46:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2025-01-09 12:46:51,803 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 92 [2025-01-09 12:46:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:51,804 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2025-01-09 12:46:51,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2025-01-09 12:46:51,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 12:46:51,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:51,805 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:51,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:46:51,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:51,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:51,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2038519522, now seen corresponding path program 1 times [2025-01-09 12:46:51,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:51,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148084596] [2025-01-09 12:46:51,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:51,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:51,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 12:46:51,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 12:46:51,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:51,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:51,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148084596] [2025-01-09 12:46:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148084596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:51,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:51,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:46:51,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096330916] [2025-01-09 12:46:51,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:51,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:46:51,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:51,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:46:51,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:46:51,854 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:51,908 INFO L93 Difference]: Finished difference Result 176 states and 225 transitions. [2025-01-09 12:46:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:46:51,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-01-09 12:46:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:51,909 INFO L225 Difference]: With dead ends: 176 [2025-01-09 12:46:51,909 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 12:46:51,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:46:51,910 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 31 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:51,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 154 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 12:46:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2025-01-09 12:46:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 63 states have internal predecessors, (72), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:46:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2025-01-09 12:46:51,918 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 93 [2025-01-09 12:46:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:51,918 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2025-01-09 12:46:51,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2025-01-09 12:46:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 12:46:51,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:51,922 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:51,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:46:51,922 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:51,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1611614145, now seen corresponding path program 1 times [2025-01-09 12:46:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228064097] [2025-01-09 12:46:51,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:51,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 12:46:51,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 12:46:51,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:51,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:52,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228064097] [2025-01-09 12:46:52,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228064097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:52,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:52,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:46:52,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710084770] [2025-01-09 12:46:52,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:52,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:46:52,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:52,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:46:52,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:46:52,446 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:52,823 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2025-01-09 12:46:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:46:52,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-01-09 12:46:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:52,824 INFO L225 Difference]: With dead ends: 132 [2025-01-09 12:46:52,824 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 12:46:52,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:46:52,825 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 96 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:52,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 457 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:46:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 12:46:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2025-01-09 12:46:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:46:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2025-01-09 12:46:52,840 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 95 [2025-01-09 12:46:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:52,841 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2025-01-09 12:46:52,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2025-01-09 12:46:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 12:46:52,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:52,843 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:52,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:46:52,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:52,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1024808131, now seen corresponding path program 1 times [2025-01-09 12:46:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:52,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245073433] [2025-01-09 12:46:52,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:52,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:52,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 12:46:52,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 12:46:52,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:52,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:53,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:53,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245073433] [2025-01-09 12:46:53,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245073433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:53,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:53,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:46:53,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286989714] [2025-01-09 12:46:53,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:53,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:46:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:53,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:46:53,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:46:53,133 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:53,518 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2025-01-09 12:46:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:46:53,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-01-09 12:46:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:53,520 INFO L225 Difference]: With dead ends: 139 [2025-01-09 12:46:53,520 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 12:46:53,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:46:53,520 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 92 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:53,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 469 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:46:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 12:46:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2025-01-09 12:46:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:46:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2025-01-09 12:46:53,534 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 95 [2025-01-09 12:46:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:53,534 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2025-01-09 12:46:53,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2025-01-09 12:46:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 12:46:53,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:53,535 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:53,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:46:53,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:53,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1692382178, now seen corresponding path program 1 times [2025-01-09 12:46:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:53,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902969131] [2025-01-09 12:46:53,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:53,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 12:46:53,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 12:46:53,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:53,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:53,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902969131] [2025-01-09 12:46:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902969131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:53,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:46:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818703966] [2025-01-09 12:46:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:53,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:46:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:53,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:46:53,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:53,566 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:53,599 INFO L93 Difference]: Finished difference Result 210 states and 268 transitions. [2025-01-09 12:46:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:46:53,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-01-09 12:46:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:53,601 INFO L225 Difference]: With dead ends: 210 [2025-01-09 12:46:53,601 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:46:53,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:53,602 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 55 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:53,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 124 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:46:53,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-01-09 12:46:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.120879120879121) internal successors, (102), 93 states have internal predecessors, (102), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:46:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2025-01-09 12:46:53,620 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 95 [2025-01-09 12:46:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:53,622 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2025-01-09 12:46:53,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2025-01-09 12:46:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 12:46:53,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:53,623 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:53,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:46:53,623 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:53,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1645227407, now seen corresponding path program 1 times [2025-01-09 12:46:53,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:53,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047012372] [2025-01-09 12:46:53,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:53,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:53,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 12:46:53,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 12:46:53,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:53,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:53,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:53,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047012372] [2025-01-09 12:46:53,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047012372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:53,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:53,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:46:53,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943055147] [2025-01-09 12:46:53,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:53,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:46:53,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:53,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:46:53,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:53,670 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:53,729 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2025-01-09 12:46:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:46:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-01-09 12:46:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:53,730 INFO L225 Difference]: With dead ends: 247 [2025-01-09 12:46:53,730 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:46:53,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:53,731 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:53,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 167 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:46:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-01-09 12:46:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.10989010989011) internal successors, (101), 93 states have internal predecessors, (101), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:46:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2025-01-09 12:46:53,745 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 96 [2025-01-09 12:46:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:53,746 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2025-01-09 12:46:53,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2025-01-09 12:46:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 12:46:53,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:53,747 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:53,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:46:53,747 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:53,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:53,749 INFO L85 PathProgramCache]: Analyzing trace with hash -145930866, now seen corresponding path program 1 times [2025-01-09 12:46:53,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:53,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132971498] [2025-01-09 12:46:53,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:53,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:53,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 12:46:53,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 12:46:53,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:53,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:53,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:53,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132971498] [2025-01-09 12:46:53,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132971498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:53,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:53,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:46:53,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293844483] [2025-01-09 12:46:53,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:53,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:46:53,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:53,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:46:53,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:46:53,802 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:53,901 INFO L93 Difference]: Finished difference Result 256 states and 321 transitions. [2025-01-09 12:46:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:46:53,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-01-09 12:46:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:53,902 INFO L225 Difference]: With dead ends: 256 [2025-01-09 12:46:53,902 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 12:46:53,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:46:53,903 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 18 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:53,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 185 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:46:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 12:46:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2025-01-09 12:46:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.098901098901099) internal successors, (100), 93 states have internal predecessors, (100), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:46:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2025-01-09 12:46:53,919 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 96 [2025-01-09 12:46:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:53,920 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2025-01-09 12:46:53,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:46:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2025-01-09 12:46:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 12:46:53,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:53,920 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:53,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:46:53,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:53,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash -902129880, now seen corresponding path program 1 times [2025-01-09 12:46:53,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:53,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605173645] [2025-01-09 12:46:53,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:53,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 12:46:53,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 12:46:53,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:53,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:46:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605173645] [2025-01-09 12:46:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605173645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:53,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:46:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821894116] [2025-01-09 12:46:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:53,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:46:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:53,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:46:53,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:46:53,970 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 12:46:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:54,112 INFO L93 Difference]: Finished difference Result 260 states and 327 transitions. [2025-01-09 12:46:54,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:46:54,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2025-01-09 12:46:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:54,113 INFO L225 Difference]: With dead ends: 260 [2025-01-09 12:46:54,115 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 12:46:54,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:46:54,116 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 108 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:54,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 120 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:46:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 12:46:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2025-01-09 12:46:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:46:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2025-01-09 12:46:54,129 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 135 transitions. Word has length 97 [2025-01-09 12:46:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:54,129 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 135 transitions. [2025-01-09 12:46:54,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 12:46:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 135 transitions. [2025-01-09 12:46:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 12:46:54,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:54,130 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:54,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:46:54,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:54,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash 820873857, now seen corresponding path program 1 times [2025-01-09 12:46:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:54,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531676930] [2025-01-09 12:46:54,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:54,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:54,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:54,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:54,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:46:54,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476916375] [2025-01-09 12:46:54,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:54,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:54,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:54,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:54,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:46:54,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:54,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:54,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:54,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:46:54,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:46:54,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:54,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:54,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:54,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:46:54,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:46:54,289 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:46:54,290 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:46:54,298 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 12:46:54,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 12:46:54,498 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:54,560 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:46:54,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:46:54 BoogieIcfgContainer [2025-01-09 12:46:54,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:46:54,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:46:54,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:46:54,565 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:46:54,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:44" (3/4) ... [2025-01-09 12:46:54,567 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:46:54,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:46:54,568 INFO L158 Benchmark]: Toolchain (without parser) took 10665.80ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 104.8MB in the beginning and 171.0MB in the end (delta: -66.2MB). Peak memory consumption was 144.8MB. Max. memory is 16.1GB. [2025-01-09 12:46:54,568 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:46:54,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.39ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 91.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:46:54,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.23ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 88.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:46:54,569 INFO L158 Benchmark]: Boogie Preprocessor took 47.09ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:46:54,569 INFO L158 Benchmark]: RCFGBuilder took 342.88ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 67.2MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:46:54,569 INFO L158 Benchmark]: TraceAbstraction took 10034.23ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 66.2MB in the beginning and 171.1MB in the end (delta: -104.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-01-09 12:46:54,570 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 352.3MB. Free memory was 171.1MB in the beginning and 171.0MB in the end (delta: 110.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:46:54,571 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.39ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 91.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.23ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 88.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.09ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 342.88ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 67.2MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10034.23ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 66.2MB in the beginning and 171.1MB in the end (delta: -104.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 352.3MB. Free memory was 171.1MB in the beginning and 171.0MB in the end (delta: 110.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 91, overapproximation of bitwiseOr at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] signed long int var_1_8 = 127; [L27] signed long int var_1_10 = 0; [L28] signed long int var_1_11 = 128; [L29] signed long int var_1_12 = 24; [L30] signed short int var_1_14 = -128; [L31] signed char var_1_15 = 64; [L32] signed char var_1_16 = 5; [L33] signed long int var_1_17 = 1; [L34] unsigned short int last_1_var_1_1 = 128; VAL [isInitial=0, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=127] [L95] isInitial = 1 [L96] FCALL initially() [L98] CALL updateLastVariables() [L88] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=127] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=127] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=127] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=127] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=127] [L70] var_1_3 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=127] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=127] [L72] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=4, var_1_8=127] [L72] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=4, var_1_8=127] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_8=127] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_8=127] [L75] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_8=127] [L75] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_8=127] [L76] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L76] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L77] var_1_10 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L78] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L79] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L79] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L80] var_1_11 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L81] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L82] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L82] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L83] var_1_16 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=2, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=2, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L84] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=2, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L85] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=2, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=2, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L85] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=2, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L99] RET updateVariables() [L100] CALL step() [L38] var_1_14 = 200 [L39] var_1_15 = var_1_16 [L40] var_1_17 = var_1_10 [L41] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L42] COND TRUE \read(var_1_2) [L43] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L51] signed long int stepLocal_2 = var_1_3 + var_1_1; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L52] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L52] signed long int stepLocal_1 = var_1_14 ^ var_1_15; [L53] COND TRUE var_1_15 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=127] [L54] COND TRUE var_1_1 == stepLocal_1 [L55] var_1_8 = (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=1] [L62] COND FALSE !(var_1_15 > var_1_15) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=1] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=1] [L91] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=1] [L91] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=1] [L91] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=1] [L91] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=1] [L91-L92] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10)))) && ((var_1_15 > var_1_15) ? (var_1_12 == ((signed long int) ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) : 1)) && (var_1_14 == ((signed short int) 200))) && (var_1_15 == ((signed char) var_1_16))) && (var_1_17 == ((signed long int) var_1_10)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=0, var_1_12=24, var_1_14=200, var_1_15=2, var_1_16=2, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=-65535, var_1_4=-255, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 16, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 815 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 815 mSDsluCounter, 3452 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2231 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2051 IncrementalHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 1221 mSDtfsCounter, 2051 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=12, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 296 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1674 NumberOfCodeBlocks, 1674 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1460 ConstructedInterpolants, 0 QuantifiedInterpolants, 4877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 4968/4992 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:46:54,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.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 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:46:56,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:46:56,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:46:56,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:46:56,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:46:56,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:46:56,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:46:56,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:46:56,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:46:56,642 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:46:56,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:46:56,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:46:56,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:46:56,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:46:56,643 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:46:56,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:46:56,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:46:56,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:46:56,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:46:56,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:46:56,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:46:56,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:56,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:56,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:56,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:56,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:46:56,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:56,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:56,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:56,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:56,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:46:56,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:46:56,646 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:46:56,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:46:56,646 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:46:56,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:46:56,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:46:56,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:46:56,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:46:56,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:46:56,646 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 -> 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 [2025-01-09 12:46:56,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:46:56,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:46:56,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:46:56,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:46:56,898 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:46:56,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2025-01-09 12:46:58,117 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e18ffa189/7b01605550cb478280455345c3f906b7/FLAG424b749f7 [2025-01-09 12:46:58,304 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:46:58,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2025-01-09 12:46:58,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e18ffa189/7b01605550cb478280455345c3f906b7/FLAG424b749f7 [2025-01-09 12:46:58,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e18ffa189/7b01605550cb478280455345c3f906b7 [2025-01-09 12:46:58,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:46:58,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:46:58,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:58,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:46:58,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:46:58,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4130564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58, skipping insertion in model container [2025-01-09 12:46:58,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:46:58,795 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i[916,929] [2025-01-09 12:46:58,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:58,833 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:46:58,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i[916,929] [2025-01-09 12:46:58,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:58,868 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:46:58,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58 WrapperNode [2025-01-09 12:46:58,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:58,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:58,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:46:58,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:46:58,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,896 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-01-09 12:46:58,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:58,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:46:58,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:46:58,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:46:58,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,919 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:46:58,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:46:58,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:46:58,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:46:58,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:46:58,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (1/1) ... [2025-01-09 12:46:58,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:58,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:58,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:46:58,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:46:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:46:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:46:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:46:58,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:46:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:46:58,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:46:59,044 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:46:59,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:46:59,212 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:46:59,213 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:46:59,219 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:46:59,220 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:46:59,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:59 BoogieIcfgContainer [2025-01-09 12:46:59,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:46:59,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:46:59,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:46:59,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:46:59,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:46:58" (1/3) ... [2025-01-09 12:46:59,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5452b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:59, skipping insertion in model container [2025-01-09 12:46:59,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:58" (2/3) ... [2025-01-09 12:46:59,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5452b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:59, skipping insertion in model container [2025-01-09 12:46:59,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:59" (3/3) ... [2025-01-09 12:46:59,227 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-83.i [2025-01-09 12:46:59,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:46:59,238 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-83.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:46:59,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:46:59,279 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;@5c29edf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:46:59,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:46:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 12:46:59,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:59,288 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:59,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:59,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:59,291 INFO L85 PathProgramCache]: Analyzing trace with hash -448909633, now seen corresponding path program 1 times [2025-01-09 12:46:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:46:59,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380124748] [2025-01-09 12:46:59,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:59,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:59,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:59,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:59,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:46:59,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 12:46:59,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 12:46:59,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:59,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:59,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:46:59,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 12:46:59,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:59,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:46:59,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380124748] [2025-01-09 12:46:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380124748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:59,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:59,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:46:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365261078] [2025-01-09 12:46:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:59,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:46:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:46:59,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:46:59,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:46:59,482 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 12:46:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:59,499 INFO L93 Difference]: Finished difference Result 80 states and 132 transitions. [2025-01-09 12:46:59,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:46:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 84 [2025-01-09 12:46:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:59,506 INFO L225 Difference]: With dead ends: 80 [2025-01-09 12:46:59,507 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 12:46:59,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:46:59,513 INFO L435 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:59,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 12:46:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 12:46:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:46:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-01-09 12:46:59,544 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 84 [2025-01-09 12:46:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:59,544 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-01-09 12:46:59,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 12:46:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-01-09 12:46:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 12:46:59,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:59,549 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:59,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:46:59,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:59,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash -753774525, now seen corresponding path program 1 times [2025-01-09 12:46:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:46:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044703992] [2025-01-09 12:46:59,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:59,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:59,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:59,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:59,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:46:59,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 12:46:59,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 12:46:59,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:59,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:59,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 12:46:59,859 INFO L279 TraceCheckSpWp]: Computing forward predicates...