./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.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_operatoramount_amount100_file-20.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 36737b7958ca72f0774fc0f7ccab03861500afa24766b605f5269ead47c0b677 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:03:56,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:03:56,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:03:56,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:03:56,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:03:56,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:03:56,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:03:56,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:03:56,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:03:56,562 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:03:56,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:03:56,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:03:56,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:03:56,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:03:56,563 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:03:56,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:03:56,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:03:56,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:03:56,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:03:56,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:03:56,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:03:56,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:03:56,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:03:56,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:03:56,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:03:56,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:03:56,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:03:56,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:03:56,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:03:56,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:03:56,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:03:56,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:03:56,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:03:56,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:03:56,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:03:56,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:03:56,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:03:56,566 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 -> 36737b7958ca72f0774fc0f7ccab03861500afa24766b605f5269ead47c0b677 [2025-01-09 14:03:56,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:03:56,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:03:56,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:03:56,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:03:56,869 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:03:56,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.i [2025-01-09 14:03:58,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a2b85b04/722cbacbc2b041f7b393edf1b751401e/FLAG4eedc5847 [2025-01-09 14:03:58,453 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:03:58,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.i [2025-01-09 14:03:58,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a2b85b04/722cbacbc2b041f7b393edf1b751401e/FLAG4eedc5847 [2025-01-09 14:03:58,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a2b85b04/722cbacbc2b041f7b393edf1b751401e [2025-01-09 14:03:58,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:03:58,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:03:58,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:03:58,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:03:58,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:03:58,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:58,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2623ecf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58, skipping insertion in model container [2025-01-09 14:03:58,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:58,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:03:58,662 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_operatoramount_amount100_file-20.i[916,929] [2025-01-09 14:03:58,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:03:58,778 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:03:58,788 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_operatoramount_amount100_file-20.i[916,929] [2025-01-09 14:03:58,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:03:58,866 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:03:58,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58 WrapperNode [2025-01-09 14:03:58,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:03:58,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:03:58,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:03:58,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:03: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 02:03:58" (1/1) ... [2025-01-09 14:03:58,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:58,945 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2025-01-09 14:03:58,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:03:58,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:03:58,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:03:58,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:03:58,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:58,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:58,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:59,004 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 14:03:59,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:59,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:59,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:59,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:59,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:59,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:59,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:59,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:03:59,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:03:59,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:03:59,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:03:59,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (1/1) ... [2025-01-09 14:03:59,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:03:59,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:03:59,106 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 14:03:59,108 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 14:03:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:03:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:03:59,130 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:03:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:03:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:03:59,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:03:59,200 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:03:59,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:03:59,665 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-09 14:03:59,665 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:03:59,681 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:03:59,683 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:03:59,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:03:59 BoogieIcfgContainer [2025-01-09 14:03:59,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:03:59,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:03:59,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:03:59,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:03:59,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:03:58" (1/3) ... [2025-01-09 14:03:59,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a325a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:03:59, skipping insertion in model container [2025-01-09 14:03:59,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:03:58" (2/3) ... [2025-01-09 14:03:59,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a325a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:03:59, skipping insertion in model container [2025-01-09 14:03:59,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:03:59" (3/3) ... [2025-01-09 14:03:59,695 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-20.i [2025-01-09 14:03:59,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:03:59,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-20.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:03:59,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:03:59,796 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;@5817dfcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:03:59,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:03:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 14:03:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 14:03:59,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:03:59,815 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:03:59,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:03:59,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:03:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash -682309356, now seen corresponding path program 1 times [2025-01-09 14:03:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:03:59,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241784180] [2025-01-09 14:03:59,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:03:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:03:59,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 14:03:59,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 14:03:59,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:03:59,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 14:04:00,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241784180] [2025-01-09 14:04:00,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241784180] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:04:00,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196277846] [2025-01-09 14:04:00,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:00,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:04:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:04:00,220 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 14:04:00,222 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 14:04:00,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 14:04:00,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 14:04:00,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:00,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:00,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:04:00,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:04:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 14:04:00,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:04:00,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196277846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:00,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:04:00,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:04:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711045942] [2025-01-09 14:04:00,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:00,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:04:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:00,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:04:00,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:04:00,512 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 14:04:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:00,542 INFO L93 Difference]: Finished difference Result 224 states and 382 transitions. [2025-01-09 14:04:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:04:00,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 204 [2025-01-09 14:04:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:00,549 INFO L225 Difference]: With dead ends: 224 [2025-01-09 14:04:00,549 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 14:04:00,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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 14:04:00,555 INFO L435 NwaCegarLoop]: 173 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, 173 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 14:04:00,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:04:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 14:04:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 14:04:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 14:04:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-01-09 14:04:00,598 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 204 [2025-01-09 14:04:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:00,598 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-01-09 14:04:00,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 14:04:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-01-09 14:04:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 14:04:00,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:00,602 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:00,609 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 14:04:00,803 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 14:04:00,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1973126170, now seen corresponding path program 1 times [2025-01-09 14:04:00,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:00,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969135198] [2025-01-09 14:04:00,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:00,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 14:04:00,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 14:04:00,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:00,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:01,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:01,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969135198] [2025-01-09 14:04:01,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969135198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:01,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:01,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:04:01,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46470553] [2025-01-09 14:04:01,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:01,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:04:01,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:01,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:04:01,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:04:01,496 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:01,820 INFO L93 Difference]: Finished difference Result 364 states and 565 transitions. [2025-01-09 14:04:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:04:01,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 14:04:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:01,827 INFO L225 Difference]: With dead ends: 364 [2025-01-09 14:04:01,827 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 14:04:01,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:04:01,832 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 176 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:01,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 723 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:04:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 14:04:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2025-01-09 14:04:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:04:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 375 transitions. [2025-01-09 14:04:01,881 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 375 transitions. Word has length 204 [2025-01-09 14:04:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:01,882 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 375 transitions. [2025-01-09 14:04:01,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 375 transitions. [2025-01-09 14:04:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 14:04:01,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:01,888 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:01,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:04:01,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:01,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:01,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1006120293, now seen corresponding path program 1 times [2025-01-09 14:04:01,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:01,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916835178] [2025-01-09 14:04:01,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:01,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:01,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 14:04:02,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 14:04:02,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:02,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916835178] [2025-01-09 14:04:02,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916835178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:02,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:02,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:04:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142485348] [2025-01-09 14:04:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:02,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:04:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:02,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:04:02,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:04:02,401 INFO L87 Difference]: Start difference. First operand 244 states and 375 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:02,684 INFO L93 Difference]: Finished difference Result 709 states and 1090 transitions. [2025-01-09 14:04:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:04:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-01-09 14:04:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:02,693 INFO L225 Difference]: With dead ends: 709 [2025-01-09 14:04:02,694 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 14:04:02,695 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 14:04:02,697 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 143 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:02,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 581 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:04:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 14:04:02,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 319. [2025-01-09 14:04:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 254 states have (on average 1.4488188976377954) internal successors, (368), 254 states have internal predecessors, (368), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:04:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 492 transitions. [2025-01-09 14:04:02,757 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 492 transitions. Word has length 205 [2025-01-09 14:04:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:02,759 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 492 transitions. [2025-01-09 14:04:02,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 492 transitions. [2025-01-09 14:04:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 14:04:02,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:02,763 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:02,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:04:02,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1211432069, now seen corresponding path program 1 times [2025-01-09 14:04:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:02,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444254593] [2025-01-09 14:04:02,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:02,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 14:04:02,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 14:04:02,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:02,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:05,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444254593] [2025-01-09 14:04:05,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444254593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:05,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:05,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:04:05,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723190288] [2025-01-09 14:04:05,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:05,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:04:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:05,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:04:05,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:04:05,459 INFO L87 Difference]: Start difference. First operand 319 states and 492 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:06,253 INFO L93 Difference]: Finished difference Result 1071 states and 1646 transitions. [2025-01-09 14:04:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:04:06,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 14:04:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:06,259 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 14:04:06,259 INFO L226 Difference]: Without dead ends: 755 [2025-01-09 14:04:06,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:04:06,261 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 372 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:06,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 545 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:04:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-01-09 14:04:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 451. [2025-01-09 14:04:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 386 states have (on average 1.4896373056994818) internal successors, (575), 386 states have internal predecessors, (575), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:04:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 699 transitions. [2025-01-09 14:04:06,291 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 699 transitions. Word has length 206 [2025-01-09 14:04:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:06,291 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 699 transitions. [2025-01-09 14:04:06,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 699 transitions. [2025-01-09 14:04:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 14:04:06,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:06,294 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:06,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:04:06,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:06,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash -68431609, now seen corresponding path program 1 times [2025-01-09 14:04:06,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:06,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543631750] [2025-01-09 14:04:06,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:06,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 14:04:06,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 14:04:06,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:06,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:07,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543631750] [2025-01-09 14:04:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543631750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:07,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:07,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:04:07,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013515330] [2025-01-09 14:04:07,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:07,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:04:07,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:07,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:04:07,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:04:07,993 INFO L87 Difference]: Start difference. First operand 451 states and 699 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:09,403 INFO L93 Difference]: Finished difference Result 1210 states and 1865 transitions. [2025-01-09 14:04:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:04:09,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 14:04:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:09,411 INFO L225 Difference]: With dead ends: 1210 [2025-01-09 14:04:09,411 INFO L226 Difference]: Without dead ends: 762 [2025-01-09 14:04:09,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:04:09,416 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 319 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:09,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 670 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:04:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-01-09 14:04:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 451. [2025-01-09 14:04:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 386 states have (on average 1.4896373056994818) internal successors, (575), 386 states have internal predecessors, (575), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:04:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 699 transitions. [2025-01-09 14:04:09,463 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 699 transitions. Word has length 206 [2025-01-09 14:04:09,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:09,464 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 699 transitions. [2025-01-09 14:04:09,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 699 transitions. [2025-01-09 14:04:09,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 14:04:09,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:09,469 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:09,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:04:09,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:09,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1634133895, now seen corresponding path program 1 times [2025-01-09 14:04:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:09,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506278438] [2025-01-09 14:04:09,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:09,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:09,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 14:04:09,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 14:04:09,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:09,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:11,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:11,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506278438] [2025-01-09 14:04:11,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506278438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:11,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:11,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:04:11,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568892522] [2025-01-09 14:04:11,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:11,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:04:11,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:11,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:04:11,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:04:11,607 INFO L87 Difference]: Start difference. First operand 451 states and 699 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:12,810 INFO L93 Difference]: Finished difference Result 1162 states and 1756 transitions. [2025-01-09 14:04:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:04:12,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 14:04:12,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:12,815 INFO L225 Difference]: With dead ends: 1162 [2025-01-09 14:04:12,816 INFO L226 Difference]: Without dead ends: 714 [2025-01-09 14:04:12,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:04:12,818 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 264 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:12,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 663 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:04:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-01-09 14:04:12,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 463. [2025-01-09 14:04:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 398 states have (on average 1.4924623115577889) internal successors, (594), 398 states have internal predecessors, (594), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:04:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 718 transitions. [2025-01-09 14:04:12,857 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 718 transitions. Word has length 206 [2025-01-09 14:04:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:12,858 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 718 transitions. [2025-01-09 14:04:12,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 718 transitions. [2025-01-09 14:04:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 14:04:12,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:12,861 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:12,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:04:12,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:12,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:12,862 INFO L85 PathProgramCache]: Analyzing trace with hash 354270217, now seen corresponding path program 1 times [2025-01-09 14:04:12,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:12,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933576009] [2025-01-09 14:04:12,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:12,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 14:04:12,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 14:04:12,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:12,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:14,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933576009] [2025-01-09 14:04:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933576009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:14,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:04:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611258530] [2025-01-09 14:04:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:14,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:04:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:14,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:04:14,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:04:14,157 INFO L87 Difference]: Start difference. First operand 463 states and 718 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:14,958 INFO L93 Difference]: Finished difference Result 1269 states and 1923 transitions. [2025-01-09 14:04:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:04:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 14:04:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:14,964 INFO L225 Difference]: With dead ends: 1269 [2025-01-09 14:04:14,965 INFO L226 Difference]: Without dead ends: 809 [2025-01-09 14:04:14,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:04:14,966 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 320 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:14,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 818 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:04:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-01-09 14:04:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 433. [2025-01-09 14:04:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 368 states have (on average 1.486413043478261) internal successors, (547), 368 states have internal predecessors, (547), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:04:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 671 transitions. [2025-01-09 14:04:15,011 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 671 transitions. Word has length 206 [2025-01-09 14:04:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:15,013 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 671 transitions. [2025-01-09 14:04:15,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 671 transitions. [2025-01-09 14:04:15,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 14:04:15,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:15,019 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:15,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:04:15,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:15,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1448420825, now seen corresponding path program 1 times [2025-01-09 14:04:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178459177] [2025-01-09 14:04:15,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:15,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 14:04:15,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 14:04:15,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:15,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:15,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:15,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178459177] [2025-01-09 14:04:15,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178459177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:15,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:15,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:04:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90745637] [2025-01-09 14:04:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:04:15,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:15,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:04:15,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:04:15,148 INFO L87 Difference]: Start difference. First operand 433 states and 671 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:15,234 INFO L93 Difference]: Finished difference Result 1136 states and 1763 transitions. [2025-01-09 14:04:15,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:04:15,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 14:04:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:15,239 INFO L225 Difference]: With dead ends: 1136 [2025-01-09 14:04:15,240 INFO L226 Difference]: Without dead ends: 706 [2025-01-09 14:04:15,241 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 14:04:15,241 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 149 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:15,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 456 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:04:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-01-09 14:04:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 559. [2025-01-09 14:04:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 494 states have (on average 1.5121457489878543) internal successors, (747), 494 states have internal predecessors, (747), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:04:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 871 transitions. [2025-01-09 14:04:15,278 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 871 transitions. Word has length 206 [2025-01-09 14:04:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:15,280 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 871 transitions. [2025-01-09 14:04:15,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 871 transitions. [2025-01-09 14:04:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 14:04:15,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:15,285 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:15,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:04:15,285 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:15,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1989029794, now seen corresponding path program 1 times [2025-01-09 14:04:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:15,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366974005] [2025-01-09 14:04:15,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:15,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:15,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 14:04:15,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 14:04:15,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:15,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:15,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:15,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366974005] [2025-01-09 14:04:15,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366974005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:15,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:15,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:04:15,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526880364] [2025-01-09 14:04:15,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:15,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:04:15,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:15,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:04:15,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:04:15,486 INFO L87 Difference]: Start difference. First operand 559 states and 871 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:15,821 INFO L93 Difference]: Finished difference Result 1394 states and 2172 transitions. [2025-01-09 14:04:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:04:15,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-01-09 14:04:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:15,827 INFO L225 Difference]: With dead ends: 1394 [2025-01-09 14:04:15,827 INFO L226 Difference]: Without dead ends: 838 [2025-01-09 14:04:15,830 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 14:04:15,830 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 154 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:15,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 657 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:04:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-01-09 14:04:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 571. [2025-01-09 14:04:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 506 states have (on average 1.507905138339921) internal successors, (763), 506 states have internal predecessors, (763), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:04:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 887 transitions. [2025-01-09 14:04:15,867 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 887 transitions. Word has length 207 [2025-01-09 14:04:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:15,867 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 887 transitions. [2025-01-09 14:04:15,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 887 transitions. [2025-01-09 14:04:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 14:04:15,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:15,870 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:15,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:04:15,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:15,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 708878784, now seen corresponding path program 1 times [2025-01-09 14:04:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631065591] [2025-01-09 14:04:15,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:15,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 14:04:15,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 14:04:15,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:15,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 14:04:16,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631065591] [2025-01-09 14:04:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631065591] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:04:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479132115] [2025-01-09 14:04:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:16,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:04:16,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:04:16,541 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 14:04:16,542 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 14:04:16,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 14:04:16,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 14:04:16,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:16,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:16,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:04:16,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:04:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 482 proven. 150 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2025-01-09 14:04:17,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:04:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 14:04:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479132115] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:04:17,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:04:17,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 22 [2025-01-09 14:04:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696315150] [2025-01-09 14:04:17,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:04:17,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 14:04:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:17,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 14:04:17,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:04:17,847 INFO L87 Difference]: Start difference. First operand 571 states and 887 transitions. Second operand has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 21 states have internal predecessors, (107), 4 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2025-01-09 14:04:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:20,868 INFO L93 Difference]: Finished difference Result 1734 states and 2604 transitions. [2025-01-09 14:04:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-09 14:04:20,869 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 21 states have internal predecessors, (107), 4 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) Word has length 208 [2025-01-09 14:04:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:20,876 INFO L225 Difference]: With dead ends: 1734 [2025-01-09 14:04:20,877 INFO L226 Difference]: Without dead ends: 1166 [2025-01-09 14:04:20,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1028, Invalid=3802, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 14:04:20,881 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1128 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:20,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1167 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 14:04:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-01-09 14:04:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 754. [2025-01-09 14:04:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 615 states have (on average 1.4439024390243902) internal successors, (888), 617 states have internal predecessors, (888), 124 states have call successors, (124), 14 states have call predecessors, (124), 14 states have return successors, (124), 122 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 14:04:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1136 transitions. [2025-01-09 14:04:20,959 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1136 transitions. Word has length 208 [2025-01-09 14:04:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:20,961 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1136 transitions. [2025-01-09 14:04:20,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 21 states have internal predecessors, (107), 4 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2025-01-09 14:04:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1136 transitions. [2025-01-09 14:04:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 14:04:20,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:20,963 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:20,972 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 14:04:21,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:04:21,164 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:21,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1096559550, now seen corresponding path program 1 times [2025-01-09 14:04:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:21,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294670616] [2025-01-09 14:04:21,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:21,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 14:04:21,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 14:04:21,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:21,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 14:04:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294670616] [2025-01-09 14:04:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294670616] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:04:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267744725] [2025-01-09 14:04:21,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:21,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:04:21,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:04:21,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:04:21,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:04:21,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 14:04:21,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 14:04:21,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:21,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:21,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:04:21,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:04:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 812 proven. 198 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-01-09 14:04:22,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:04:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 14:04:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267744725] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:04:23,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:04:23,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 18 [2025-01-09 14:04:23,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713946119] [2025-01-09 14:04:23,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:04:23,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:04:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:23,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:04:23,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:04:23,008 INFO L87 Difference]: Start difference. First operand 754 states and 1136 transitions. Second operand has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 17 states have internal predecessors, (147), 6 states have call successors, (82), 3 states have call predecessors, (82), 5 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) [2025-01-09 14:04:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:24,533 INFO L93 Difference]: Finished difference Result 2083 states and 3025 transitions. [2025-01-09 14:04:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 14:04:24,536 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 17 states have internal predecessors, (147), 6 states have call successors, (82), 3 states have call predecessors, (82), 5 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) Word has length 208 [2025-01-09 14:04:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:24,547 INFO L225 Difference]: With dead ends: 2083 [2025-01-09 14:04:24,547 INFO L226 Difference]: Without dead ends: 1263 [2025-01-09 14:04:24,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=497, Invalid=1759, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 14:04:24,551 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 848 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:24,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1406 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:04:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2025-01-09 14:04:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1009. [2025-01-09 14:04:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 820 states have (on average 1.3756097560975609) internal successors, (1128), 824 states have internal predecessors, (1128), 154 states have call successors, (154), 34 states have call predecessors, (154), 34 states have return successors, (154), 150 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 14:04:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1436 transitions. [2025-01-09 14:04:24,664 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1436 transitions. Word has length 208 [2025-01-09 14:04:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:24,664 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1436 transitions. [2025-01-09 14:04:24,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 17 states have internal predecessors, (147), 6 states have call successors, (82), 3 states have call predecessors, (82), 5 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) [2025-01-09 14:04:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1436 transitions. [2025-01-09 14:04:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 14:04:24,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:24,669 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:24,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:04:24,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:04:24,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:24,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1182489980, now seen corresponding path program 1 times [2025-01-09 14:04:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:24,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749279027] [2025-01-09 14:04:24,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:24,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 14:04:24,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 14:04:24,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:24,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:27,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749279027] [2025-01-09 14:04:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749279027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:27,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:04:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073502435] [2025-01-09 14:04:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:27,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:04:27,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:27,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:04:27,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:04:27,074 INFO L87 Difference]: Start difference. First operand 1009 states and 1436 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:35,751 INFO L93 Difference]: Finished difference Result 2201 states and 3129 transitions. [2025-01-09 14:04:35,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:04:35,752 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-01-09 14:04:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:35,762 INFO L225 Difference]: With dead ends: 2201 [2025-01-09 14:04:35,762 INFO L226 Difference]: Without dead ends: 1672 [2025-01-09 14:04:35,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:04:35,765 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 610 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:35,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1357 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 14:04:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-01-09 14:04:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1043. [2025-01-09 14:04:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 853 states have (on average 1.3786635404454866) internal successors, (1176), 857 states have internal predecessors, (1176), 154 states have call successors, (154), 35 states have call predecessors, (154), 35 states have return successors, (154), 150 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 14:04:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1484 transitions. [2025-01-09 14:04:35,892 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1484 transitions. Word has length 208 [2025-01-09 14:04:35,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:35,892 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1484 transitions. [2025-01-09 14:04:35,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1484 transitions. [2025-01-09 14:04:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 14:04:35,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:35,896 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:35,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:04:35,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:35,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash 171372730, now seen corresponding path program 1 times [2025-01-09 14:04:35,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:35,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960768049] [2025-01-09 14:04:35,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:35,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:35,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 14:04:36,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 14:04:36,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:36,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:37,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:37,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960768049] [2025-01-09 14:04:37,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960768049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:37,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:04:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435469945] [2025-01-09 14:04:37,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:37,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:04:37,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:37,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:04:37,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:04:37,298 INFO L87 Difference]: Start difference. First operand 1043 states and 1484 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:38,456 INFO L93 Difference]: Finished difference Result 2350 states and 3367 transitions. [2025-01-09 14:04:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:04:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-01-09 14:04:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:38,463 INFO L225 Difference]: With dead ends: 2350 [2025-01-09 14:04:38,463 INFO L226 Difference]: Without dead ends: 1501 [2025-01-09 14:04:38,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:04:38,465 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 347 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:38,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 580 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:04:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-01-09 14:04:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1058. [2025-01-09 14:04:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 868 states have (on average 1.381336405529954) internal successors, (1199), 872 states have internal predecessors, (1199), 154 states have call successors, (154), 35 states have call predecessors, (154), 35 states have return successors, (154), 150 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 14:04:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1507 transitions. [2025-01-09 14:04:38,596 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1507 transitions. Word has length 208 [2025-01-09 14:04:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:38,597 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1507 transitions. [2025-01-09 14:04:38,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1507 transitions. [2025-01-09 14:04:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 14:04:38,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:38,598 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:38,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:04:38,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:38,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1086907867, now seen corresponding path program 1 times [2025-01-09 14:04:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785482189] [2025-01-09 14:04:38,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:38,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 14:04:38,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 14:04:38,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:38,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:40,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:40,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785482189] [2025-01-09 14:04:40,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785482189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:40,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:40,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:04:40,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431681400] [2025-01-09 14:04:40,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:40,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:04:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:40,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:04:40,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:04:40,495 INFO L87 Difference]: Start difference. First operand 1058 states and 1507 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:41,576 INFO L93 Difference]: Finished difference Result 2555 states and 3660 transitions. [2025-01-09 14:04:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:04:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-01-09 14:04:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:41,585 INFO L225 Difference]: With dead ends: 2555 [2025-01-09 14:04:41,585 INFO L226 Difference]: Without dead ends: 1695 [2025-01-09 14:04:41,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:04:41,589 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 222 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:41,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 660 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:04:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-01-09 14:04:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1156. [2025-01-09 14:04:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 966 states have (on average 1.4099378881987579) internal successors, (1362), 970 states have internal predecessors, (1362), 154 states have call successors, (154), 35 states have call predecessors, (154), 35 states have return successors, (154), 150 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 14:04:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1670 transitions. [2025-01-09 14:04:41,723 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1670 transitions. Word has length 209 [2025-01-09 14:04:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:41,724 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1670 transitions. [2025-01-09 14:04:41,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1670 transitions. [2025-01-09 14:04:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 14:04:41,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:41,726 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:41,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:04:41,726 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:41,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:41,727 INFO L85 PathProgramCache]: Analyzing trace with hash -600260285, now seen corresponding path program 1 times [2025-01-09 14:04:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386346308] [2025-01-09 14:04:41,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:41,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 14:04:41,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 14:04:41,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:41,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:43,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:43,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386346308] [2025-01-09 14:04:43,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386346308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:43,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:43,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:04:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869707708] [2025-01-09 14:04:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:43,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:04:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:43,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:04:43,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:04:43,881 INFO L87 Difference]: Start difference. First operand 1156 states and 1670 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:45,632 INFO L93 Difference]: Finished difference Result 2625 states and 3772 transitions. [2025-01-09 14:04:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:04:45,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 14:04:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:45,640 INFO L225 Difference]: With dead ends: 2625 [2025-01-09 14:04:45,641 INFO L226 Difference]: Without dead ends: 1625 [2025-01-09 14:04:45,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:04:45,645 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 490 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:45,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 911 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:04:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-01-09 14:04:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1221. [2025-01-09 14:04:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1031 states have (on average 1.4131910766246363) internal successors, (1457), 1035 states have internal predecessors, (1457), 154 states have call successors, (154), 35 states have call predecessors, (154), 35 states have return successors, (154), 150 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 14:04:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1765 transitions. [2025-01-09 14:04:45,780 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1765 transitions. Word has length 210 [2025-01-09 14:04:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:45,781 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1765 transitions. [2025-01-09 14:04:45,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1765 transitions. [2025-01-09 14:04:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 14:04:45,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:45,784 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:45,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:04:45,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1611377535, now seen corresponding path program 1 times [2025-01-09 14:04:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342068289] [2025-01-09 14:04:45,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:45,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:45,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 14:04:45,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 14:04:45,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:45,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:48,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:48,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342068289] [2025-01-09 14:04:48,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342068289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:48,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:48,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:04:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543259050] [2025-01-09 14:04:48,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:48,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:04:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:48,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:04:48,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:04:48,400 INFO L87 Difference]: Start difference. First operand 1221 states and 1765 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:50,380 INFO L93 Difference]: Finished difference Result 2810 states and 4020 transitions. [2025-01-09 14:04:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:04:50,380 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 14:04:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:50,387 INFO L225 Difference]: With dead ends: 2810 [2025-01-09 14:04:50,387 INFO L226 Difference]: Without dead ends: 1743 [2025-01-09 14:04:50,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:04:50,389 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 497 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:50,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 953 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:04:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-01-09 14:04:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1232. [2025-01-09 14:04:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1042 states have (on average 1.4107485604606527) internal successors, (1470), 1046 states have internal predecessors, (1470), 154 states have call successors, (154), 35 states have call predecessors, (154), 35 states have return successors, (154), 150 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 14:04:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1778 transitions. [2025-01-09 14:04:50,507 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1778 transitions. Word has length 210 [2025-01-09 14:04:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:50,508 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1778 transitions. [2025-01-09 14:04:50,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1778 transitions. [2025-01-09 14:04:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 14:04:50,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:50,510 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:50,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:04:50,511 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:50,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash 994646019, now seen corresponding path program 1 times [2025-01-09 14:04:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:50,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879898815] [2025-01-09 14:04:50,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:50,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 14:04:50,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 14:04:50,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:50,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:50,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879898815] [2025-01-09 14:04:50,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879898815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:50,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:50,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:04:50,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057769832] [2025-01-09 14:04:50,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:50,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:04:50,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:50,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:04:50,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:04:50,854 INFO L87 Difference]: Start difference. First operand 1232 states and 1778 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 14:04:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:51,517 INFO L93 Difference]: Finished difference Result 4475 states and 6510 transitions. [2025-01-09 14:04:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:04:51,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 210 [2025-01-09 14:04:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:51,529 INFO L225 Difference]: With dead ends: 4475 [2025-01-09 14:04:51,529 INFO L226 Difference]: Without dead ends: 3424 [2025-01-09 14:04:51,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:04:51,532 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 404 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:51,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 867 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:04:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2025-01-09 14:04:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 2329. [2025-01-09 14:04:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 1988 states have (on average 1.403420523138833) internal successors, (2790), 1996 states have internal predecessors, (2790), 277 states have call successors, (277), 63 states have call predecessors, (277), 63 states have return successors, (277), 269 states have call predecessors, (277), 277 states have call successors, (277) [2025-01-09 14:04:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3344 transitions. [2025-01-09 14:04:51,774 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3344 transitions. Word has length 210 [2025-01-09 14:04:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:51,775 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 3344 transitions. [2025-01-09 14:04:51,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 14:04:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3344 transitions. [2025-01-09 14:04:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 14:04:51,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:51,777 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:51,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:04:51,777 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:51,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:51,778 INFO L85 PathProgramCache]: Analyzing trace with hash -381405567, now seen corresponding path program 1 times [2025-01-09 14:04:51,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:51,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550581047] [2025-01-09 14:04:51,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:51,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:51,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 14:04:52,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 14:04:52,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:52,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:04:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:04:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:04:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550581047] [2025-01-09 14:04:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550581047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:04:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:04:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:04:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683743413] [2025-01-09 14:04:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:04:54,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:04:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:04:54,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:04:54,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:04:54,902 INFO L87 Difference]: Start difference. First operand 2329 states and 3344 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:04:56,791 INFO L93 Difference]: Finished difference Result 3522 states and 5034 transitions. [2025-01-09 14:04:56,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:04:56,792 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 14:04:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:04:56,803 INFO L225 Difference]: With dead ends: 3522 [2025-01-09 14:04:56,803 INFO L226 Difference]: Without dead ends: 2481 [2025-01-09 14:04:56,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:04:56,807 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 210 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:04:56,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 876 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:04:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-01-09 14:04:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2324. [2025-01-09 14:04:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1983 states have (on average 1.4034291477559253) internal successors, (2783), 1991 states have internal predecessors, (2783), 277 states have call successors, (277), 63 states have call predecessors, (277), 63 states have return successors, (277), 269 states have call predecessors, (277), 277 states have call successors, (277) [2025-01-09 14:04:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3337 transitions. [2025-01-09 14:04:57,066 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3337 transitions. Word has length 210 [2025-01-09 14:04:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:04:57,066 INFO L471 AbstractCegarLoop]: Abstraction has 2324 states and 3337 transitions. [2025-01-09 14:04:57,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:04:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3337 transitions. [2025-01-09 14:04:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 14:04:57,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:04:57,072 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:57,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:04:57,072 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:04:57,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:04:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1392522817, now seen corresponding path program 1 times [2025-01-09 14:04:57,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:04:57,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201651949] [2025-01-09 14:04:57,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:04:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:04:57,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 14:04:57,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 14:04:57,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:04:57,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:05:00,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:00,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201651949] [2025-01-09 14:05:00,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201651949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:00,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 14:05:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815716185] [2025-01-09 14:05:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:00,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:05:00,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:00,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:05:00,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:05:00,989 INFO L87 Difference]: Start difference. First operand 2324 states and 3337 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:05:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:04,511 INFO L93 Difference]: Finished difference Result 4642 states and 6645 transitions. [2025-01-09 14:05:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:05:04,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 14:05:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:04,524 INFO L225 Difference]: With dead ends: 4642 [2025-01-09 14:05:04,524 INFO L226 Difference]: Without dead ends: 2976 [2025-01-09 14:05:04,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:05:04,528 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 699 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:04,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 942 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 14:05:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2025-01-09 14:05:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2370. [2025-01-09 14:05:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2029 states have (on average 1.4066042385411532) internal successors, (2854), 2037 states have internal predecessors, (2854), 277 states have call successors, (277), 63 states have call predecessors, (277), 63 states have return successors, (277), 269 states have call predecessors, (277), 277 states have call successors, (277) [2025-01-09 14:05:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3408 transitions. [2025-01-09 14:05:04,747 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3408 transitions. Word has length 210 [2025-01-09 14:05:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:04,748 INFO L471 AbstractCegarLoop]: Abstraction has 2370 states and 3408 transitions. [2025-01-09 14:05:04,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:05:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3408 transitions. [2025-01-09 14:05:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 14:05:04,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:04,750 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:05:04,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:05:04,750 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:04,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -466246779, now seen corresponding path program 1 times [2025-01-09 14:05:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569490164] [2025-01-09 14:05:04,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:04,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 14:05:04,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 14:05:04,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:04,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:05:04,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569490164] [2025-01-09 14:05:04,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569490164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:04,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:04,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:05:04,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393295866] [2025-01-09 14:05:04,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:04,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:05:04,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:04,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:05:04,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:05:04,892 INFO L87 Difference]: Start difference. First operand 2370 states and 3408 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:05:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:05,064 INFO L93 Difference]: Finished difference Result 2882 states and 4131 transitions. [2025-01-09 14:05:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:05:05,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 14:05:05,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:05,070 INFO L225 Difference]: With dead ends: 2882 [2025-01-09 14:05:05,070 INFO L226 Difference]: Without dead ends: 1204 [2025-01-09 14:05:05,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 14:05:05,074 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 156 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:05,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 423 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:05:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2025-01-09 14:05:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1167. [2025-01-09 14:05:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 926 states have (on average 1.2786177105831533) internal successors, (1184), 931 states have internal predecessors, (1184), 195 states have call successors, (195), 45 states have call predecessors, (195), 45 states have return successors, (195), 190 states have call predecessors, (195), 195 states have call successors, (195) [2025-01-09 14:05:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1574 transitions. [2025-01-09 14:05:05,203 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1574 transitions. Word has length 210 [2025-01-09 14:05:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:05,203 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1574 transitions. [2025-01-09 14:05:05,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:05:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1574 transitions. [2025-01-09 14:05:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 14:05:05,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:05,207 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:05:05,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 14:05:05,207 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:05,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1105630727, now seen corresponding path program 1 times [2025-01-09 14:05:05,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:05,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952647366] [2025-01-09 14:05:05,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:05,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:05,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 14:05:05,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 14:05:05,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:05,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat