./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 011eeefd9cffe2be7e7193891aba89325b816eb252a09909cc785439e897f756 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:00:56,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:00:56,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:00:56,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:00:56,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:00:56,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:00:56,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:00:56,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:00:56,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:00:56,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:00:56,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:00:56,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:00:56,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:00:56,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:00:56,748 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:00:56,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:00:56,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:00:56,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:00:56,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:00:56,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:00:56,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:00:56,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:00:56,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:00:56,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:00:56,756 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:00:56,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:00:56,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:00:56,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:00:56,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:00:56,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:00:56,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:00:56,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:00:56,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:00:56,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:00:56,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:00:56,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:00:56,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:00:56,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:00:56,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:00:56,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:00:56,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:00:56,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:00:56,762 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 011eeefd9cffe2be7e7193891aba89325b816eb252a09909cc785439e897f756 [2024-11-10 06:00:57,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:00:57,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:00:57,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:00:57,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:00:57,093 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:00:57,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i [2024-11-10 06:00:58,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:00:59,050 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:00:59,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i [2024-11-10 06:00:59,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b706e4d81/07a0489aaa6142898909dd9ffd6d2681/FLAGe74ef1ed1 [2024-11-10 06:00:59,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b706e4d81/07a0489aaa6142898909dd9ffd6d2681 [2024-11-10 06:00:59,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:00:59,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:00:59,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:00:59,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:00:59,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:00:59,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf9eb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59, skipping insertion in model container [2024-11-10 06:00:59,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:00:59,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i[919,932] [2024-11-10 06:00:59,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:00:59,407 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:00:59,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i[919,932] [2024-11-10 06:00:59,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:00:59,517 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:00:59,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59 WrapperNode [2024-11-10 06:00:59,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:00:59,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:00:59,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:00:59,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:00:59,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,583 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-10 06:00:59,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:00:59,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:00:59,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:00:59,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:00:59,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,647 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]. [2024-11-10 06:00:59,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:00:59,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:00:59,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:00:59,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:00:59,678 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (1/1) ... [2024-11-10 06:00:59,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:00:59,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:00:59,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:00:59,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:00:59,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:00:59,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:00:59,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:00:59,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:00:59,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:00:59,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:00:59,910 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:00:59,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:01:00,364 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 06:01:00,365 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:01:00,393 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:01:00,394 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 06:01:00,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:01:00 BoogieIcfgContainer [2024-11-10 06:01:00,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:01:00,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:01:00,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:01:00,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:01:00,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:00:59" (1/3) ... [2024-11-10 06:01:00,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53113da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:01:00, skipping insertion in model container [2024-11-10 06:01:00,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:59" (2/3) ... [2024-11-10 06:01:00,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53113da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:01:00, skipping insertion in model container [2024-11-10 06:01:00,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:01:00" (3/3) ... [2024-11-10 06:01:00,413 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i [2024-11-10 06:01:00,436 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:01:00,437 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:01:00,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:01:00,536 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;@37c554ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:01:00,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:01:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 06:01:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 06:01:00,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:01:00,564 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:01:00,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:01:00,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:01:00,572 INFO L85 PathProgramCache]: Analyzing trace with hash 430398442, now seen corresponding path program 1 times [2024-11-10 06:01:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:01:00,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906520431] [2024-11-10 06:01:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:01:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:01:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:01:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:01:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:01:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:01:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:01:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:01:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:01:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:01:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:01:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:01:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:01:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:01:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:01:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:01:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:01:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:01:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:01:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:01:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:01:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:01:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:01:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 06:01:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 06:01:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:01:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 06:01:01,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:01:01,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906520431] [2024-11-10 06:01:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906520431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:01:01,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:01:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:01:01,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156368281] [2024-11-10 06:01:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:01:01,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:01:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:01:01,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:01:01,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:01:01,321 INFO L87 Difference]: Start difference. First operand has 88 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 06:01:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:01:01,356 INFO L93 Difference]: Finished difference Result 168 states and 290 transitions. [2024-11-10 06:01:01,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:01:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 169 [2024-11-10 06:01:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:01:01,367 INFO L225 Difference]: With dead ends: 168 [2024-11-10 06:01:01,367 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 06:01:01,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:01:01,376 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:01:01,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:01:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 06:01:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 06:01:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 06:01:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2024-11-10 06:01:01,436 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 169 [2024-11-10 06:01:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:01:01,437 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2024-11-10 06:01:01,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 06:01:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2024-11-10 06:01:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 06:01:01,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:01:01,443 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:01:01,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:01:01,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:01:01,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:01:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1735911381, now seen corresponding path program 1 times [2024-11-10 06:01:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:01:01,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548548262] [2024-11-10 06:01:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:01:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:01:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:01:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:01:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:01:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:01:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:01:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:01:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:01:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:01:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:01:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:01:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:01:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:01:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:01:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:01:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:01:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:01:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:01:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:01:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:01:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:01:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:01:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 06:01:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 06:01:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:01:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 06:01:02,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:01:02,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548548262] [2024-11-10 06:01:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548548262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:01:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:01:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:01:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45478901] [2024-11-10 06:01:02,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:01:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:01:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:01:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:01:02,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:01:02,459 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 06:01:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:01:02,748 INFO L93 Difference]: Finished difference Result 245 states and 380 transitions. [2024-11-10 06:01:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:01:02,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2024-11-10 06:01:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:01:02,760 INFO L225 Difference]: With dead ends: 245 [2024-11-10 06:01:02,761 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 06:01:02,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:01:02,763 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 109 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:01:02,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 361 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:01:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 06:01:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2024-11-10 06:01:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 06:01:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 229 transitions. [2024-11-10 06:01:02,817 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 229 transitions. Word has length 169 [2024-11-10 06:01:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:01:02,818 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 229 transitions. [2024-11-10 06:01:02,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 06:01:02,818 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 229 transitions. [2024-11-10 06:01:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 06:01:02,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:01:02,821 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:01:02,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:01:02,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:01:02,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:01:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash -811244550, now seen corresponding path program 1 times [2024-11-10 06:01:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:01:02,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004979814] [2024-11-10 06:01:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:01:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:01:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:01:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:01:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:01:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:01:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:01:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:01:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:01:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:01:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:01:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:01:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:01:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:01:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:01:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:01:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:01:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:01:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:01:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:01:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:01:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:01:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:01:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 06:01:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 06:01:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:01:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 06:01:03,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:01:03,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004979814] [2024-11-10 06:01:03,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004979814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:01:03,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:01:03,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:01:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598670306] [2024-11-10 06:01:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:01:03,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:01:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:01:03,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:01:03,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:01:03,400 INFO L87 Difference]: Start difference. First operand 147 states and 229 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 06:01:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:01:03,696 INFO L93 Difference]: Finished difference Result 324 states and 510 transitions. [2024-11-10 06:01:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:01:03,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-10 06:01:03,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:01:03,700 INFO L225 Difference]: With dead ends: 324 [2024-11-10 06:01:03,700 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 06:01:03,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 06:01:03,703 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 88 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:01:03,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 362 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:01:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 06:01:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 228. [2024-11-10 06:01:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 149 states have (on average 1.395973154362416) internal successors, (208), 149 states have internal predecessors, (208), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-10 06:01:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 358 transitions. [2024-11-10 06:01:03,759 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 358 transitions. Word has length 170 [2024-11-10 06:01:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:01:03,760 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 358 transitions. [2024-11-10 06:01:03,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 06:01:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 358 transitions. [2024-11-10 06:01:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 06:01:03,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:01:03,766 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:01:03,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:01:03,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:01:03,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:01:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1655716421, now seen corresponding path program 1 times [2024-11-10 06:01:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:01:03,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657894331] [2024-11-10 06:01:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:01:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:01:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:01:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:01:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:01:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:01:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:01:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:01:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:01:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:01:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:01:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:01:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:01:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:01:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:01:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:01:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:01:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:01:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:01:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:01:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:01:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:01:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:01:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 06:01:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 06:01:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:01:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-10 06:01:04,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:01:04,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657894331] [2024-11-10 06:01:04,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657894331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:01:04,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863538111] [2024-11-10 06:01:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:04,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:01:04,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:01:04,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:01:04,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:01:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:04,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 06:01:04,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:01:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-10 06:01:04,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:01:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-10 06:01:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863538111] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:01:05,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:01:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 06:01:05,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894660292] [2024-11-10 06:01:05,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:01:05,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:01:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:01:05,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:01:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:01:05,056 INFO L87 Difference]: Start difference. First operand 228 states and 358 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-10 06:01:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:01:05,383 INFO L93 Difference]: Finished difference Result 411 states and 635 transitions. [2024-11-10 06:01:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 06:01:05,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 170 [2024-11-10 06:01:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:01:05,388 INFO L225 Difference]: With dead ends: 411 [2024-11-10 06:01:05,388 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 06:01:05,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:01:05,390 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 116 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:01:05,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 274 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:01:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 06:01:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2024-11-10 06:01:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 158 states have (on average 1.3544303797468353) internal successors, (214), 158 states have internal predecessors, (214), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-10 06:01:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 364 transitions. [2024-11-10 06:01:05,427 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 364 transitions. Word has length 170 [2024-11-10 06:01:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:01:05,427 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 364 transitions. [2024-11-10 06:01:05,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-10 06:01:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 364 transitions. [2024-11-10 06:01:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 06:01:05,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:01:05,431 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:01:05,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:01:05,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:01:05,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:01:05,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:01:05,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1642178522, now seen corresponding path program 1 times [2024-11-10 06:01:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:01:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074290363] [2024-11-10 06:01:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:01:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:01:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53676793] [2024-11-10 06:01:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:05,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:01:05,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:01:05,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:01:05,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 06:01:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:05,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 06:01:05,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:01:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 788 proven. 135 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-10 06:01:07,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:01:50,344 WARN L286 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 06:02:25,682 WARN L286 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)