./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 797978612f30d276056fc2b56f0a1bab84683294631fe6e91b1bcc4d4c68636a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:35:16,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:35:16,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:35:16,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:35:16,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:35:16,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:35:16,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:35:16,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:35:16,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:35:16,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:35:16,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:35:16,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:35:16,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:35:16,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:35:16,867 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:35:16,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:35:16,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:35:16,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:35:16,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:35:16,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:35:16,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:35:16,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:35:16,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:35:16,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:35:16,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:35:16,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:35:16,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:35:16,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:35:16,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:35:16,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:35:16,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:35:16,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:35:16,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:35:16,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:35:16,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:35:16,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:35:16,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:35:16,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:35:16,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:35:16,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:35:16,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:35:16,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:35:16,874 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-clean/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-clean/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 -> 797978612f30d276056fc2b56f0a1bab84683294631fe6e91b1bcc4d4c68636a [2024-10-11 11:35:17,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:35:17,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:35:17,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:35:17,106 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:35:17,106 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:35:17,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-2.i [2024-10-11 11:35:18,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:35:18,588 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:35:18,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-2.i [2024-10-11 11:35:18,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ecc517ee/a3266c278afd4b0fad0a7c24b0e5bfee/FLAGe5813b7ab [2024-10-11 11:35:18,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ecc517ee/a3266c278afd4b0fad0a7c24b0e5bfee [2024-10-11 11:35:18,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:35:18,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:35:18,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:35:18,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:35:18,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:35:18,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:18,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74231873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18, skipping insertion in model container [2024-10-11 11:35:18,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:18,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:35:18,835 WARN L248 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_loopvsstraightlinecode_25-while_file-2.i[914,927] [2024-10-11 11:35:18,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:35:18,895 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:35:18,907 WARN L248 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_loopvsstraightlinecode_25-while_file-2.i[914,927] [2024-10-11 11:35:18,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:35:18,944 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:35:18,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18 WrapperNode [2024-10-11 11:35:18,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:35:18,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:35:18,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:35:18,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:35:18,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:18,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,001 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-10-11 11:35:19,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:35:19,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:35:19,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:35:19,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:35:19,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,033 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-10-11 11:35:19,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:35:19,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:35:19,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:35:19,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:35:19,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (1/1) ... [2024-10-11 11:35:19,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:35:19,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:35:19,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:35:19,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:35:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:35:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:35:19,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:35:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:35:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:35:19,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:35:19,186 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:35:19,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:35:19,382 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 11:35:19,382 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:35:19,428 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:35:19,428 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:35:19,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:35:19 BoogieIcfgContainer [2024-10-11 11:35:19,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:35:19,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:35:19,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:35:19,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:35:19,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:35:18" (1/3) ... [2024-10-11 11:35:19,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9d9c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:35:19, skipping insertion in model container [2024-10-11 11:35:19,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:18" (2/3) ... [2024-10-11 11:35:19,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9d9c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:35:19, skipping insertion in model container [2024-10-11 11:35:19,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:35:19" (3/3) ... [2024-10-11 11:35:19,436 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-2.i [2024-10-11 11:35:19,450 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:35:19,450 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:35:19,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:35:19,501 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;@1eb4e01c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:35:19,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:35:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 11:35:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 11:35:19,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:19,515 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:19,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:19,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1099332257, now seen corresponding path program 1 times [2024-10-11 11:35:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:19,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600554189] [2024-10-11 11:35:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:19,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:19,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:19,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:19,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:19,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:19,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:19,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600554189] [2024-10-11 11:35:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600554189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:19,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:19,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:35:19,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982807948] [2024-10-11 11:35:19,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:19,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:35:19,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:19,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:35:19,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:35:19,794 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 11:35:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:19,833 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2024-10-11 11:35:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:35:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-11 11:35:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:19,850 INFO L225 Difference]: With dead ends: 63 [2024-10-11 11:35:19,850 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 11:35:19,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-10-11 11:35:19,856 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:19,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:35:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 11:35:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 11:35:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 11:35:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-10-11 11:35:19,888 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 54 [2024-10-11 11:35:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:19,888 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-10-11 11:35:19,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 11:35:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-10-11 11:35:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 11:35:19,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:19,890 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:19,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:35:19,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:19,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1927738719, now seen corresponding path program 1 times [2024-10-11 11:35:19,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:19,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282031193] [2024-10-11 11:35:19,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:19,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:20,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:20,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:20,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:20,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:20,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:20,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:20,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282031193] [2024-10-11 11:35:20,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282031193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:20,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:20,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:35:20,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012362351] [2024-10-11 11:35:20,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:20,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:35:20,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:35:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:35:20,547 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 11:35:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:20,729 INFO L93 Difference]: Finished difference Result 101 states and 143 transitions. [2024-10-11 11:35:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:35:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-11 11:35:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:20,734 INFO L225 Difference]: With dead ends: 101 [2024-10-11 11:35:20,735 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 11:35:20,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:35:20,737 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 66 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:20,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 186 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:35:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 11:35:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2024-10-11 11:35:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 11:35:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-10-11 11:35:20,759 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 54 [2024-10-11 11:35:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:20,759 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-10-11 11:35:20,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 11:35:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-10-11 11:35:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 11:35:20,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:20,762 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:20,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:35:20,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:20,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1118392093, now seen corresponding path program 1 times [2024-10-11 11:35:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380665310] [2024-10-11 11:35:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:23,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:23,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:23,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:23,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:23,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380665310] [2024-10-11 11:35:23,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380665310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:23,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:23,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:35:23,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257255284] [2024-10-11 11:35:23,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:23,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:35:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:35:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:35:23,295 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:27,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 11:35:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:27,764 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-10-11 11:35:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:35:27,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 54 [2024-10-11 11:35:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:27,767 INFO L225 Difference]: With dead ends: 89 [2024-10-11 11:35:27,769 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 11:35:27,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:35:27,770 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 58 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:27,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 127 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 11:35:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 11:35:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2024-10-11 11:35:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 11:35:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-10-11 11:35:27,781 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 54 [2024-10-11 11:35:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:27,781 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-10-11 11:35:27,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-10-11 11:35:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 11:35:27,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:27,783 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:27,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:35:27,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:27,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1642918390, now seen corresponding path program 1 times [2024-10-11 11:35:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189179902] [2024-10-11 11:35:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:27,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:28,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:28,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189179902] [2024-10-11 11:35:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189179902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:35:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393427820] [2024-10-11 11:35:28,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:28,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:35:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:28,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:35:28,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:35:28,379 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:28,705 INFO L93 Difference]: Finished difference Result 199 states and 277 transitions. [2024-10-11 11:35:28,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:35:28,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-11 11:35:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:28,707 INFO L225 Difference]: With dead ends: 199 [2024-10-11 11:35:28,708 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 11:35:28,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:35:28,709 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 104 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:28,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 181 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:35:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 11:35:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2024-10-11 11:35:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 11:35:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-10-11 11:35:28,728 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 55 [2024-10-11 11:35:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:28,729 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-10-11 11:35:28,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-10-11 11:35:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 11:35:28,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:28,730 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:28,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:35:28,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:28,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:28,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1700176692, now seen corresponding path program 1 times [2024-10-11 11:35:28,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:28,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47112270] [2024-10-11 11:35:28,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:28,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:28,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47112270] [2024-10-11 11:35:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47112270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:28,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:28,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:35:28,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519378758] [2024-10-11 11:35:28,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:28,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:35:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:28,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:35:28,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:35:28,769 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:28,801 INFO L93 Difference]: Finished difference Result 275 states and 388 transitions. [2024-10-11 11:35:28,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:35:28,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-11 11:35:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:28,803 INFO L225 Difference]: With dead ends: 275 [2024-10-11 11:35:28,803 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 11:35:28,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-10-11 11:35:28,808 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:28,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:35:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 11:35:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2024-10-11 11:35:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 99 states have internal predecessors, (123), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:35:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 199 transitions. [2024-10-11 11:35:28,842 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 199 transitions. Word has length 55 [2024-10-11 11:35:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:28,842 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 199 transitions. [2024-10-11 11:35:28,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 199 transitions. [2024-10-11 11:35:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 11:35:28,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:28,843 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:28,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:35:28,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:28,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash 962860020, now seen corresponding path program 1 times [2024-10-11 11:35:28,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:28,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390456543] [2024-10-11 11:35:28,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:28,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:34,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:34,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:34,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:34,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390456543] [2024-10-11 11:35:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390456543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:35:34,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319615429] [2024-10-11 11:35:34,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:34,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:35:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:34,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:35:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:35:34,797 INFO L87 Difference]: Start difference. First operand 143 states and 199 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:38,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 11:35:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:43,012 INFO L93 Difference]: Finished difference Result 226 states and 310 transitions. [2024-10-11 11:35:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:35:43,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-11 11:35:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:43,016 INFO L225 Difference]: With dead ends: 226 [2024-10-11 11:35:43,016 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 11:35:43,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:35:43,017 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:43,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 115 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 11:35:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 11:35:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 145. [2024-10-11 11:35:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.25) internal successors, (125), 101 states have internal predecessors, (125), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:35:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2024-10-11 11:35:43,043 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 55 [2024-10-11 11:35:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:43,044 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2024-10-11 11:35:43,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2024-10-11 11:35:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 11:35:43,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:43,046 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:43,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:35:43,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:43,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash -324168414, now seen corresponding path program 1 times [2024-10-11 11:35:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:43,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875086824] [2024-10-11 11:35:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:43,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:43,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875086824] [2024-10-11 11:35:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875086824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:43,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:43,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:35:43,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480051952] [2024-10-11 11:35:43,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:43,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:35:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:43,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:35:43,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:35:43,212 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:43,392 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2024-10-11 11:35:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:35:43,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-11 11:35:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:43,395 INFO L225 Difference]: With dead ends: 254 [2024-10-11 11:35:43,396 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 11:35:43,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:35:43,397 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 52 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:43,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 175 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:35:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 11:35:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2024-10-11 11:35:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 107 states have internal predecessors, (131), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:35:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2024-10-11 11:35:43,420 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 55 [2024-10-11 11:35:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:43,420 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2024-10-11 11:35:43,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2024-10-11 11:35:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 11:35:43,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:43,421 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:43,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:35:43,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:43,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1459036371, now seen corresponding path program 1 times [2024-10-11 11:35:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691450035] [2024-10-11 11:35:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:43,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:43,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691450035] [2024-10-11 11:35:43,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691450035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:43,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:35:43,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313777795] [2024-10-11 11:35:43,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:43,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:35:43,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:43,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:35:43,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:35:43,537 INFO L87 Difference]: Start difference. First operand 151 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:43,615 INFO L93 Difference]: Finished difference Result 254 states and 345 transitions. [2024-10-11 11:35:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:35:43,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-10-11 11:35:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:43,618 INFO L225 Difference]: With dead ends: 254 [2024-10-11 11:35:43,618 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 11:35:43,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:35:43,618 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:43,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 135 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:35:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 11:35:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2024-10-11 11:35:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 109 states have internal predecessors, (133), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:35:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2024-10-11 11:35:43,637 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 56 [2024-10-11 11:35:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:43,639 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2024-10-11 11:35:43,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2024-10-11 11:35:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 11:35:43,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:43,640 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:43,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:35:43,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:43,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1458976789, now seen corresponding path program 1 times [2024-10-11 11:35:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241180754] [2024-10-11 11:35:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:46,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:46,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:46,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:46,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:46,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:46,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241180754] [2024-10-11 11:35:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241180754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:46,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:46,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:35:46,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793760780] [2024-10-11 11:35:46,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:46,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:35:46,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:46,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:35:46,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:35:46,186 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:46,825 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2024-10-11 11:35:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 11:35:46,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-10-11 11:35:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:46,827 INFO L225 Difference]: With dead ends: 182 [2024-10-11 11:35:46,827 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 11:35:46,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 11:35:46,828 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:46,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 202 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:35:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 11:35:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 160. [2024-10-11 11:35:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 116 states have internal predecessors, (141), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:35:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 217 transitions. [2024-10-11 11:35:46,843 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 217 transitions. Word has length 56 [2024-10-11 11:35:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:46,843 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 217 transitions. [2024-10-11 11:35:46,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 217 transitions. [2024-10-11 11:35:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 11:35:46,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:46,845 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:35:46,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:35:46,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:46,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1356229116, now seen corresponding path program 1 times [2024-10-11 11:35:46,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:46,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943312836] [2024-10-11 11:35:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:48,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:48,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:35:48,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943312836] [2024-10-11 11:35:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943312836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:48,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:48,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 11:35:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982267187] [2024-10-11 11:35:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:48,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:35:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:48,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:35:48,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:35:48,097 INFO L87 Difference]: Start difference. First operand 160 states and 217 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:48,682 INFO L93 Difference]: Finished difference Result 206 states and 275 transitions. [2024-10-11 11:35:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:35:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-10-11 11:35:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:48,683 INFO L225 Difference]: With dead ends: 206 [2024-10-11 11:35:48,683 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 11:35:48,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2024-10-11 11:35:48,684 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 98 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:48,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 198 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:35:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 11:35:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2024-10-11 11:35:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 139 states have internal predecessors, (169), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 11:35:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2024-10-11 11:35:48,700 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 57 [2024-10-11 11:35:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:48,700 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2024-10-11 11:35:48,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 11:35:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2024-10-11 11:35:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 11:35:48,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:48,701 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:35:48,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 11:35:48,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:48,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash 244190447, now seen corresponding path program 1 times [2024-10-11 11:35:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:48,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092657136] [2024-10-11 11:35:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 11:35:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:35:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 11:35:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:35:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 11:35:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:35:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:35:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:35:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-10-11 11:35:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092657136] [2024-10-11 11:35:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092657136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:35:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803834390] [2024-10-11 11:35:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:50,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:35:50,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:35:50,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:35:50,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:35:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:50,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 11:35:50,419 INFO L278 TraceCheckSpWp]: Computing forward predicates...