./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.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-pe-ci_file-59.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 6d60c41fdcdaad38dc038867a7c9992a8ab8f45b7eb867ab47c18062a0edd8d7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:56:50,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:56:50,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:56:50,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:56:50,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:56:50,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:56:50,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:56:50,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:56:50,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:56:50,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:56:50,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:56:50,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:56:50,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:56:50,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:56:50,498 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:56:50,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:56:50,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:56:50,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:56:50,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:56:50,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:56:50,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:56:50,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:56:50,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:56:50,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:56:50,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:56:50,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:56:50,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:56:50,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:56:50,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:56:50,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:56:50,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:56:50,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:56:50,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:56:50,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:56:50,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:56:50,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:56:50,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:56:50,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:56:50,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:56:50,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:56:50,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:56:50,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:56:50,507 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 -> 6d60c41fdcdaad38dc038867a7c9992a8ab8f45b7eb867ab47c18062a0edd8d7 [2024-11-10 04:56:50,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:56:50,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:56:50,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:56:50,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:56:50,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:56:50,769 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-pe-ci_file-59.i [2024-11-10 04:56:52,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:56:52,490 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:56:52,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i [2024-11-10 04:56:52,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67712d728/0ea095d3fdb6427096c6366602382a37/FLAGe7cc83907 [2024-11-10 04:56:52,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67712d728/0ea095d3fdb6427096c6366602382a37 [2024-11-10 04:56:52,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:56:52,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:56:52,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:56:52,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:56:52,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:56:52,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:52,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304154e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52, skipping insertion in model container [2024-11-10 04:56:52,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:52,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:56:52,756 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-pe-ci_file-59.i[919,932] [2024-11-10 04:56:52,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:56:52,878 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:56:52,890 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-pe-ci_file-59.i[919,932] [2024-11-10 04:56:52,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:56:52,950 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:56:52,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52 WrapperNode [2024-11-10 04:56:52,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:56:52,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:56:52,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:56:52,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:56:52,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:52,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,020 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-10 04:56:53,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:56:53,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:56:53,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:56:53,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:56:53,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,062 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 04:56:53,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:56:53,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:56:53,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:56:53,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:56:53,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (1/1) ... [2024-11-10 04:56:53,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:56:53,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:56:53,144 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 04:56:53,158 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 04:56:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:56:53,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:56:53,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:56:53,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:56:53,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:56:53,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:56:53,304 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:56:53,310 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:56:53,735 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 04:56:53,736 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:56:53,762 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:56:53,763 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:56:53,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:56:53 BoogieIcfgContainer [2024-11-10 04:56:53,764 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:56:53,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:56:53,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:56:53,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:56:53,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:56:52" (1/3) ... [2024-11-10 04:56:53,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f6e18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:56:53, skipping insertion in model container [2024-11-10 04:56:53,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:56:52" (2/3) ... [2024-11-10 04:56:53,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f6e18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:56:53, skipping insertion in model container [2024-11-10 04:56:53,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:56:53" (3/3) ... [2024-11-10 04:56:53,776 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i [2024-11-10 04:56:53,792 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:56:53,793 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:56:53,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:56:53,860 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;@254b43bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:56:53,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:56:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 04:56:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 04:56:53,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:56:53,876 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:53,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:56:53,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:56:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash -313233906, now seen corresponding path program 1 times [2024-11-10 04:56:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:56:53,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670013384] [2024-11-10 04:56:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:56:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:56:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:56:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:56:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:56:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:56:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:56:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:56:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:56:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:56:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:56:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:56:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:56:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:56:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:56:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:56:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:56:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:56:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:56:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:56:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:56:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:56:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 04:56:54,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:56:54,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670013384] [2024-11-10 04:56:54,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670013384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:56:54,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:56:54,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:56:54,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841883550] [2024-11-10 04:56:54,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:56:54,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:56:54,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:56:54,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:56:54,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:56:54,407 INFO L87 Difference]: Start difference. First operand has 84 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 04:56:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:56:54,450 INFO L93 Difference]: Finished difference Result 157 states and 271 transitions. [2024-11-10 04:56:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:56:54,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2024-11-10 04:56:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:56:54,462 INFO L225 Difference]: With dead ends: 157 [2024-11-10 04:56:54,462 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 04:56:54,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 04:56:54,470 INFO L432 NwaCegarLoop]: 113 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, 113 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 04:56:54,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:56:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 04:56:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-10 04:56:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 04:56:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2024-11-10 04:56:54,516 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 138 [2024-11-10 04:56:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:56:54,517 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2024-11-10 04:56:54,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 04:56:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2024-11-10 04:56:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 04:56:54,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:56:54,520 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:54,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:56:54,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:56:54,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:56:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash -886501878, now seen corresponding path program 1 times [2024-11-10 04:56:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:56:54,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737967133] [2024-11-10 04:56:54,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:56:54,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:56:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:56:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:56:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:56:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:56:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:56:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:56:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:56:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:56:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:56:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:56:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:56:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:56:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:56:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:56:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:56:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:56:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:56:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:56:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:56:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:56:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 04:56:54,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:56:54,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737967133] [2024-11-10 04:56:54,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737967133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:56:54,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:56:54,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:56:54,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232728837] [2024-11-10 04:56:54,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:56:54,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:56:54,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:56:54,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:56:54,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:56:54,936 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 04:56:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:56:54,981 INFO L93 Difference]: Finished difference Result 149 states and 227 transitions. [2024-11-10 04:56:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:56:54,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-10 04:56:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:56:54,984 INFO L225 Difference]: With dead ends: 149 [2024-11-10 04:56:54,985 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 04:56:54,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:56:54,986 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:56:54,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:56:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 04:56:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-10 04:56:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 04:56:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2024-11-10 04:56:55,001 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 138 [2024-11-10 04:56:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:56:55,003 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2024-11-10 04:56:55,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 04:56:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2024-11-10 04:56:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 04:56:55,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:56:55,007 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:55,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:56:55,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:56:55,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:56:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 856308457, now seen corresponding path program 1 times [2024-11-10 04:56:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:56:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969372224] [2024-11-10 04:56:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:56:55,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:56:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:56:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:56:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:56:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:56:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:56:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:56:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:56:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:56:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:56:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:56:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:56:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:56:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:56:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:56:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:56:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:56:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:56:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:56:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:56:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:56:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 04:56:55,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:56:55,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969372224] [2024-11-10 04:56:55,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969372224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:56:55,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:56:55,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:56:55,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949301135] [2024-11-10 04:56:55,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:56:55,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:56:55,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:56:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:56:55,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:56:55,483 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 04:56:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:56:55,661 INFO L93 Difference]: Finished difference Result 224 states and 338 transitions. [2024-11-10 04:56:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:56:55,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-10 04:56:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:56:55,668 INFO L225 Difference]: With dead ends: 224 [2024-11-10 04:56:55,668 INFO L226 Difference]: Without dead ends: 151 [2024-11-10 04:56:55,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 04:56:55,670 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 81 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:56:55,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 320 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:56:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-10 04:56:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2024-11-10 04:56:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 04:56:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2024-11-10 04:56:55,698 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 138 [2024-11-10 04:56:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:56:55,700 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2024-11-10 04:56:55,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 04:56:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2024-11-10 04:56:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 04:56:55,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:56:55,706 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:55,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:56:55,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:56:55,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:56:55,707 INFO L85 PathProgramCache]: Analyzing trace with hash 519934603, now seen corresponding path program 1 times [2024-11-10 04:56:55,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:56:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840809828] [2024-11-10 04:56:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:56:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:56:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:56:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:56:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:56:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:56:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:56:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:56:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:56:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:56:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:56:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:56:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:56:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:56:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:56:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:56:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:56:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:56:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:56:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:56:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:56:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:56:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 04:56:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:56:56,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840809828] [2024-11-10 04:56:56,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840809828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:56:56,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:56:56,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:56:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689092058] [2024-11-10 04:56:56,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:56:56,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:56:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:56:56,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:56:56,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:56:56,098 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 04:56:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:56:56,290 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2024-11-10 04:56:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:56:56,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-11-10 04:56:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:56:56,294 INFO L225 Difference]: With dead ends: 288 [2024-11-10 04:56:56,294 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 04:56:56,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 04:56:56,296 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 121 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:56:56,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 341 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:56:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 04:56:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 185. [2024-11-10 04:56:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:56:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 279 transitions. [2024-11-10 04:56:56,336 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 279 transitions. Word has length 139 [2024-11-10 04:56:56,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:56:56,337 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 279 transitions. [2024-11-10 04:56:56,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 04:56:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 279 transitions. [2024-11-10 04:56:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 04:56:56,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:56:56,342 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:56,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:56:56,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:56:56,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:56:56,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1221952746, now seen corresponding path program 1 times [2024-11-10 04:56:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:56:56,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053168705] [2024-11-10 04:56:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:56:56,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:56:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:56:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:56:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:56:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:56:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:56:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:56:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:56:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:56:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:56:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:56:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:56:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:56:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:56:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:56:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:56:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:56:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:56:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:56:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:56:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:56:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 04:56:56,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:56:56,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053168705] [2024-11-10 04:56:56,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053168705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:56:56,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:56:56,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 04:56:56,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089659112] [2024-11-10 04:56:56,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:56:56,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 04:56:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:56:56,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 04:56:56,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:56:56,939 INFO L87 Difference]: Start difference. First operand 185 states and 279 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 04:56:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:56:57,264 INFO L93 Difference]: Finished difference Result 441 states and 662 transitions. [2024-11-10 04:56:57,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:56:57,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-10 04:56:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:56:57,268 INFO L225 Difference]: With dead ends: 441 [2024-11-10 04:56:57,268 INFO L226 Difference]: Without dead ends: 298 [2024-11-10 04:56:57,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:56:57,270 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 109 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:56:57,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 421 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:56:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-10 04:56:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2024-11-10 04:56:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 177 states have (on average 1.4124293785310735) internal successors, (250), 177 states have internal predecessors, (250), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:56:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 370 transitions. [2024-11-10 04:56:57,318 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 370 transitions. Word has length 140 [2024-11-10 04:56:57,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:56:57,319 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 370 transitions. [2024-11-10 04:56:57,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 04:56:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 370 transitions. [2024-11-10 04:56:57,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 04:56:57,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:56:57,321 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:57,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:56:57,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:56:57,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:56:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -816103543, now seen corresponding path program 1 times [2024-11-10 04:56:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:56:57,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531578717] [2024-11-10 04:56:57,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:56:57,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:56:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:56:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:56:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:56:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:56:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:56:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:56:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:56:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:56:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:56:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:56:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:56:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:56:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:56:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:56:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:56:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:56:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:56:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:56:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:56:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:56:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 04:56:57,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:56:57,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531578717] [2024-11-10 04:56:57,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531578717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:56:57,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236656723] [2024-11-10 04:56:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:56:57,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:56:57,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:56:57,718 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 04:56:57,720 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 04:56:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:57,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:56:57,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:56:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-10 04:56:58,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:56:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 04:56:58,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236656723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:56:58,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:56:58,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-10 04:56:58,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69741436] [2024-11-10 04:56:58,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:56:58,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:56:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:56:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:56:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:56:58,388 INFO L87 Difference]: Start difference. First operand 242 states and 370 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-10 04:56:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:56:58,585 INFO L93 Difference]: Finished difference Result 405 states and 605 transitions. [2024-11-10 04:56:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 04:56:58,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 140 [2024-11-10 04:56:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:56:58,588 INFO L225 Difference]: With dead ends: 405 [2024-11-10 04:56:58,591 INFO L226 Difference]: Without dead ends: 262 [2024-11-10 04:56:58,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:56:58,592 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 90 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:56:58,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 178 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:56:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-10 04:56:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 201. [2024-11-10 04:56:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 133 states have (on average 1.255639097744361) internal successors, (167), 133 states have internal predecessors, (167), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:56:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 287 transitions. [2024-11-10 04:56:58,630 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 287 transitions. Word has length 140 [2024-11-10 04:56:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:56:58,630 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 287 transitions. [2024-11-10 04:56:58,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-10 04:56:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 287 transitions. [2024-11-10 04:56:58,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 04:56:58,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:56:58,632 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:58,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 04:56:58,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 04:56:58,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:56:58,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:56:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash -654574441, now seen corresponding path program 1 times [2024-11-10 04:56:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:56:58,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93760186] [2024-11-10 04:56:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:56:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:56:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:56:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:56:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:56:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:56:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:56:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:56:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:56:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:56:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:56:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:56:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:56:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:56:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:56:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:56:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:56:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:56:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:56:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:56:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:56:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:56:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 04:56:59,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:56:59,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93760186] [2024-11-10 04:56:59,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93760186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:56:59,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276711134] [2024-11-10 04:56:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:56:59,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:56:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:56:59,267 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 04:56:59,269 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 04:56:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:56:59,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 04:56:59,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:57:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 178 proven. 96 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-10 04:57:00,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:57:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 04:57:00,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276711134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:57:00,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:57:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 15 [2024-11-10 04:57:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144739001] [2024-11-10 04:57:00,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:57:00,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 04:57:00,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:00,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 04:57:00,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:57:00,508 INFO L87 Difference]: Start difference. First operand 201 states and 287 transitions. Second operand has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 5 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-10 04:57:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:00,876 INFO L93 Difference]: Finished difference Result 372 states and 525 transitions. [2024-11-10 04:57:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 04:57:00,876 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 5 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 143 [2024-11-10 04:57:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:00,878 INFO L225 Difference]: With dead ends: 372 [2024-11-10 04:57:00,878 INFO L226 Difference]: Without dead ends: 221 [2024-11-10 04:57:00,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 319 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2024-11-10 04:57:00,880 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 234 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:00,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 180 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:57:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-10 04:57:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 209. [2024-11-10 04:57:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 139 states have (on average 1.2302158273381294) internal successors, (171), 139 states have internal predecessors, (171), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:57:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2024-11-10 04:57:00,901 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 143 [2024-11-10 04:57:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:00,901 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2024-11-10 04:57:00,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 5 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-10 04:57:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2024-11-10 04:57:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 04:57:00,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:00,903 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:57:00,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:57:01,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 04:57:01,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:01,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1417537516, now seen corresponding path program 1 times [2024-11-10 04:57:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868812668] [2024-11-10 04:57:01,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:57:01,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073105098] [2024-11-10 04:57:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:01,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:01,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:57:01,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:57:01,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 04:57:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:01,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 04:57:01,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:57:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-10 04:57:01,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:57:02,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:57:02,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868812668] [2024-11-10 04:57:02,541 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 04:57:02,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073105098] [2024-11-10 04:57:02,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073105098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:57:02,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:57:02,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-10 04:57:02,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499253829] [2024-11-10 04:57:02,542 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 04:57:02,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 04:57:02,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:57:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 04:57:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:57:02,544 INFO L87 Difference]: Start difference. First operand 209 states and 291 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 04:57:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:57:02,771 INFO L93 Difference]: Finished difference Result 380 states and 527 transitions. [2024-11-10 04:57:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:57:02,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 144 [2024-11-10 04:57:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:57:02,773 INFO L225 Difference]: With dead ends: 380 [2024-11-10 04:57:02,774 INFO L226 Difference]: Without dead ends: 221 [2024-11-10 04:57:02,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-10 04:57:02,775 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 46 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:57:02,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 231 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:57:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-10 04:57:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 209. [2024-11-10 04:57:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 139 states have (on average 1.2158273381294964) internal successors, (169), 139 states have internal predecessors, (169), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:57:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 289 transitions. [2024-11-10 04:57:02,800 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 289 transitions. Word has length 144 [2024-11-10 04:57:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:57:02,801 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 289 transitions. [2024-11-10 04:57:02,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 04:57:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 289 transitions. [2024-11-10 04:57:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 04:57:02,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:57:02,803 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:57:02,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 04:57:03,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:03,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:57:03,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:57:03,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1764728595, now seen corresponding path program 1 times [2024-11-10 04:57:03,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:57:03,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603037873] [2024-11-10 04:57:03,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:57:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:57:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837859236] [2024-11-10 04:57:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:57:03,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:57:03,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:57:03,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:57:03,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 04:57:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:57:03,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 04:57:03,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:57:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 247 proven. 195 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-10 04:57:05,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:57:26,642 WARN L286 SmtUtils]: Spent 7.90s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 04:57:34,667 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)