./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.11.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 940a677bfde7dbbc79e036121bd0ec6fd3518c0f58a02d336e5d42fafb098792 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:10:48,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:10:49,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:10:49,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:10:49,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:10:49,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:10:49,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:10:49,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:10:49,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:10:49,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:10:49,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:10:49,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:10:49,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:10:49,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:10:49,063 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:10:49,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:10:49,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:10:49,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:10:49,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:10:49,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:10:49,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:10:49,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:10:49,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:10:49,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:10:49,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:10:49,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:10:49,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:10:49,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:10:49,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:10:49,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:10:49,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:10:49,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:10:49,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:10:49,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:10:49,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:10:49,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:10:49,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:10:49,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:10:49,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:10:49,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:10:49,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:10:49,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:10:49,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 940a677bfde7dbbc79e036121bd0ec6fd3518c0f58a02d336e5d42fafb098792 [2024-11-11 21:10:49,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:10:49,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:10:49,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:10:49,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:10:49,321 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:10:49,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.11.cil.c [2024-11-11 21:10:50,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:10:50,956 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:10:50,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.11.cil.c [2024-11-11 21:10:50,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc3640f0/004e10e14205413d9ed645cddd2ca5f6/FLAG078d05dd6 [2024-11-11 21:10:51,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc3640f0/004e10e14205413d9ed645cddd2ca5f6 [2024-11-11 21:10:51,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:10:51,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:10:51,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:10:51,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:10:51,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:10:51,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5607f2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51, skipping insertion in model container [2024-11-11 21:10:51,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:10:51,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.11.cil.c[706,719] [2024-11-11 21:10:51,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:10:51,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:10:51,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.11.cil.c[706,719] [2024-11-11 21:10:51,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:10:51,419 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:10:51,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51 WrapperNode [2024-11-11 21:10:51,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:10:51,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:10:51,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:10:51,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:10:51,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,477 INFO L138 Inliner]: procedures = 50, calls = 63, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 800 [2024-11-11 21:10:51,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:10:51,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:10:51,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:10:51,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:10:51,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,524 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:10:51,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:10:51,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:10:51,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:10:51,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:10:51,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (1/1) ... [2024-11-11 21:10:51,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:10:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:10:51,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:10:51,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:10:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:10:51,638 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 21:10:51,638 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 21:10:51,638 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 21:10:51,638 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 21:10:51,638 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 21:10:51,639 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 21:10:51,639 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 21:10:51,639 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 21:10:51,639 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 21:10:51,639 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 21:10:51,639 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 21:10:51,639 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 21:10:51,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:10:51,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:10:51,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:10:51,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:10:51,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:10:52,461 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-11 21:10:52,461 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:10:52,484 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:10:52,484 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-11 21:10:52,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:10:52 BoogieIcfgContainer [2024-11-11 21:10:52,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:10:52,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:10:52,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:10:52,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:10:52,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:10:51" (1/3) ... [2024-11-11 21:10:52,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0c71b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:10:52, skipping insertion in model container [2024-11-11 21:10:52,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:10:51" (2/3) ... [2024-11-11 21:10:52,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0c71b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:10:52, skipping insertion in model container [2024-11-11 21:10:52,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:10:52" (3/3) ... [2024-11-11 21:10:52,490 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.11.cil.c [2024-11-11 21:10:52,505 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:10:52,505 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:10:52,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:10:52,600 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;@49755ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:10:52,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:10:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 333 states have (on average 1.6366366366366367) internal successors, (545), 335 states have internal predecessors, (545), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 21:10:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:10:52,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:52,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:52,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:52,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:52,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1281000696, now seen corresponding path program 1 times [2024-11-11 21:10:52,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:52,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706236851] [2024-11-11 21:10:52,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:52,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:10:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:53,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:10:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:53,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:10:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:10:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706236851] [2024-11-11 21:10:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706236851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:53,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:53,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:10:53,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195419079] [2024-11-11 21:10:53,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:53,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:10:53,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:10:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:10:53,281 INFO L87 Difference]: Start difference. First operand has 365 states, 333 states have (on average 1.6366366366366367) internal successors, (545), 335 states have internal predecessors, (545), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:10:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:54,934 INFO L93 Difference]: Finished difference Result 848 states and 1390 transitions. [2024-11-11 21:10:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:10:54,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:10:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:54,946 INFO L225 Difference]: With dead ends: 848 [2024-11-11 21:10:54,947 INFO L226 Difference]: Without dead ends: 489 [2024-11-11 21:10:54,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:10:54,953 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 957 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:54,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 724 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:10:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-11 21:10:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 360. [2024-11-11 21:10:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 329 states have (on average 1.5440729483282676) internal successors, (508), 330 states have internal predecessors, (508), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 21:10:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 556 transitions. [2024-11-11 21:10:55,031 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 556 transitions. Word has length 175 [2024-11-11 21:10:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:55,035 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 556 transitions. [2024-11-11 21:10:55,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:10:55,036 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 556 transitions. [2024-11-11 21:10:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:10:55,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:55,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:55,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:10:55,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:55,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1289358278, now seen corresponding path program 1 times [2024-11-11 21:10:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:55,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491675427] [2024-11-11 21:10:55,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:55,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:10:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:55,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:10:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:10:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:55,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:10:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491675427] [2024-11-11 21:10:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491675427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:55,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:10:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955116229] [2024-11-11 21:10:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:55,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:10:55,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:55,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:10:55,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:10:55,477 INFO L87 Difference]: Start difference. First operand 360 states and 556 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:10:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:10:57,759 INFO L93 Difference]: Finished difference Result 1315 states and 2091 transitions. [2024-11-11 21:10:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:10:57,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:10:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:10:57,767 INFO L225 Difference]: With dead ends: 1315 [2024-11-11 21:10:57,771 INFO L226 Difference]: Without dead ends: 974 [2024-11-11 21:10:57,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:10:57,779 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 1432 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:10:57,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 1221 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 21:10:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-11-11 21:10:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 716. [2024-11-11 21:10:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 659 states have (on average 1.5538694992412747) internal successors, (1024), 661 states have internal predecessors, (1024), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2024-11-11 21:10:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1113 transitions. [2024-11-11 21:10:57,846 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1113 transitions. Word has length 175 [2024-11-11 21:10:57,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:10:57,846 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1113 transitions. [2024-11-11 21:10:57,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:10:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1113 transitions. [2024-11-11 21:10:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:10:57,849 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:10:57,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:10:57,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:10:57,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:10:57,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:10:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2118987525, now seen corresponding path program 1 times [2024-11-11 21:10:57,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:10:57,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352736486] [2024-11-11 21:10:57,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:10:57,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:10:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:10:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:58,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:10:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:58,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:10:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:10:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:58,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:10:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:10:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:10:58,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:10:58,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352736486] [2024-11-11 21:10:58,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352736486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:10:58,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:10:58,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:10:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609095303] [2024-11-11 21:10:58,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:10:58,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:10:58,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:10:58,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:10:58,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:10:58,144 INFO L87 Difference]: Start difference. First operand 716 states and 1113 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:01,763 INFO L93 Difference]: Finished difference Result 2337 states and 3688 transitions. [2024-11-11 21:11:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:11:01,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:01,774 INFO L225 Difference]: With dead ends: 2337 [2024-11-11 21:11:01,774 INFO L226 Difference]: Without dead ends: 1640 [2024-11-11 21:11:01,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:11:01,777 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1573 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 4173 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:01,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 2393 Invalid, 4232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4173 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 21:11:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-11 21:11:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1048. [2024-11-11 21:11:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 968 states have internal predecessors, (1492), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (67), 63 states have call predecessors, (67), 62 states have call successors, (67) [2024-11-11 21:11:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1621 transitions. [2024-11-11 21:11:01,862 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1621 transitions. Word has length 175 [2024-11-11 21:11:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:01,862 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1621 transitions. [2024-11-11 21:11:01,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1621 transitions. [2024-11-11 21:11:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:11:01,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:01,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:01,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:11:01,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:01,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:01,867 INFO L85 PathProgramCache]: Analyzing trace with hash 770788093, now seen corresponding path program 1 times [2024-11-11 21:11:01,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:01,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284073262] [2024-11-11 21:11:01,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:01,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:11:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:02,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:11:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:11:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:11:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:02,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284073262] [2024-11-11 21:11:02,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284073262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015689583] [2024-11-11 21:11:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:02,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:02,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:02,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:02,103 INFO L87 Difference]: Start difference. First operand 1048 states and 1621 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:05,652 INFO L93 Difference]: Finished difference Result 3603 states and 5674 transitions. [2024-11-11 21:11:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:11:05,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:05,661 INFO L225 Difference]: With dead ends: 3603 [2024-11-11 21:11:05,661 INFO L226 Difference]: Without dead ends: 2574 [2024-11-11 21:11:05,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:11:05,664 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1571 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 4169 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 4230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:05,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 2391 Invalid, 4230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4169 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 21:11:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2024-11-11 21:11:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1713. [2024-11-11 21:11:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1578 states have (on average 1.5392902408111533) internal successors, (2429), 1583 states have internal predecessors, (2429), 100 states have call successors, (100), 30 states have call predecessors, (100), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-11-11 21:11:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2642 transitions. [2024-11-11 21:11:05,733 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2642 transitions. Word has length 175 [2024-11-11 21:11:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:05,733 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 2642 transitions. [2024-11-11 21:11:05,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2642 transitions. [2024-11-11 21:11:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:11:05,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:05,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:05,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:11:05,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:05,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1629845317, now seen corresponding path program 1 times [2024-11-11 21:11:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972528969] [2024-11-11 21:11:05,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:11:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:11:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:11:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:11:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:05,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:05,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972528969] [2024-11-11 21:11:05,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972528969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:05,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:05,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896688096] [2024-11-11 21:11:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:05,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:05,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:05,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:05,967 INFO L87 Difference]: Start difference. First operand 1713 states and 2642 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:09,706 INFO L93 Difference]: Finished difference Result 6042 states and 9475 transitions. [2024-11-11 21:11:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:11:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:09,723 INFO L225 Difference]: With dead ends: 6042 [2024-11-11 21:11:09,723 INFO L226 Difference]: Without dead ends: 4348 [2024-11-11 21:11:09,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:11:09,728 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1567 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 4160 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 4221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:09,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 2391 Invalid, 4221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4160 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 21:11:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2024-11-11 21:11:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 3044. [2024-11-11 21:11:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2805 states have (on average 1.5340463458110516) internal successors, (4303), 2814 states have internal predecessors, (4303), 176 states have call successors, (176), 54 states have call predecessors, (176), 62 states have return successors, (211), 183 states have call predecessors, (211), 176 states have call successors, (211) [2024-11-11 21:11:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 4690 transitions. [2024-11-11 21:11:09,887 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 4690 transitions. Word has length 175 [2024-11-11 21:11:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:09,888 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 4690 transitions. [2024-11-11 21:11:09,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 4690 transitions. [2024-11-11 21:11:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:11:09,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:09,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:09,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:11:09,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:09,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash -183264451, now seen corresponding path program 1 times [2024-11-11 21:11:09,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:09,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495473269] [2024-11-11 21:11:09,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:09,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:11:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:11:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:10,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:10,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:11:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:11:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:10,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:10,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495473269] [2024-11-11 21:11:10,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495473269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:10,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:10,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080331575] [2024-11-11 21:11:10,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:10,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:10,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:10,107 INFO L87 Difference]: Start difference. First operand 3044 states and 4690 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:13,841 INFO L93 Difference]: Finished difference Result 10919 states and 17093 transitions. [2024-11-11 21:11:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:11:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:13,863 INFO L225 Difference]: With dead ends: 10919 [2024-11-11 21:11:13,863 INFO L226 Difference]: Without dead ends: 7894 [2024-11-11 21:11:13,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:11:13,869 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1563 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 4151 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 4212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:13,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 2391 Invalid, 4212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4151 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 21:11:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7894 states. [2024-11-11 21:11:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7894 to 5711. [2024-11-11 21:11:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5711 states, 5264 states have (on average 1.5305851063829787) internal successors, (8057), 5281 states have internal predecessors, (8057), 328 states have call successors, (328), 102 states have call predecessors, (328), 118 states have return successors, (425), 343 states have call predecessors, (425), 328 states have call successors, (425) [2024-11-11 21:11:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5711 states to 5711 states and 8810 transitions. [2024-11-11 21:11:14,073 INFO L78 Accepts]: Start accepts. Automaton has 5711 states and 8810 transitions. Word has length 175 [2024-11-11 21:11:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:14,074 INFO L471 AbstractCegarLoop]: Abstraction has 5711 states and 8810 transitions. [2024-11-11 21:11:14,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5711 states and 8810 transitions. [2024-11-11 21:11:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:11:14,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:14,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:14,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:11:14,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:14,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1106431877, now seen corresponding path program 1 times [2024-11-11 21:11:14,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:14,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624457017] [2024-11-11 21:11:14,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:14,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:14,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:11:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:14,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:11:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:14,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:11:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:14,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:11:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:14,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624457017] [2024-11-11 21:11:14,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624457017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:14,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:14,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:14,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097901031] [2024-11-11 21:11:14,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:14,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:14,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:14,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:14,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:14,393 INFO L87 Difference]: Start difference. First operand 5711 states and 8810 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:18,396 INFO L93 Difference]: Finished difference Result 20672 states and 32387 transitions. [2024-11-11 21:11:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:11:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:18,440 INFO L225 Difference]: With dead ends: 20672 [2024-11-11 21:11:18,440 INFO L226 Difference]: Without dead ends: 14980 [2024-11-11 21:11:18,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:11:18,455 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1565 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 4137 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:18,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1582 Valid, 2391 Invalid, 4198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4137 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 21:11:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14980 states. [2024-11-11 21:11:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14980 to 11058. [2024-11-11 21:11:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11058 states, 10195 states have (on average 1.5284943599803826) internal successors, (15583), 10228 states have internal predecessors, (15583), 632 states have call successors, (632), 198 states have call predecessors, (632), 230 states have return successors, (907), 663 states have call predecessors, (907), 632 states have call successors, (907) [2024-11-11 21:11:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11058 states to 11058 states and 17122 transitions. [2024-11-11 21:11:19,290 INFO L78 Accepts]: Start accepts. Automaton has 11058 states and 17122 transitions. Word has length 175 [2024-11-11 21:11:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:19,291 INFO L471 AbstractCegarLoop]: Abstraction has 11058 states and 17122 transitions. [2024-11-11 21:11:19,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 11058 states and 17122 transitions. [2024-11-11 21:11:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:11:19,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:19,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:19,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:11:19,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:19,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash -720569475, now seen corresponding path program 1 times [2024-11-11 21:11:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:19,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483321825] [2024-11-11 21:11:19,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:11:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:19,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:11:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:19,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:11:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:19,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:11:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:19,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:19,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483321825] [2024-11-11 21:11:19,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483321825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:19,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:19,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:19,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135868379] [2024-11-11 21:11:19,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:19,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:19,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:19,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:19,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:19,569 INFO L87 Difference]: Start difference. First operand 11058 states and 17122 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:21,496 INFO L93 Difference]: Finished difference Result 26046 states and 41033 transitions. [2024-11-11 21:11:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:11:21,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:21,533 INFO L225 Difference]: With dead ends: 26046 [2024-11-11 21:11:21,533 INFO L226 Difference]: Without dead ends: 15007 [2024-11-11 21:11:21,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:11:21,554 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 1116 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:21,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1192 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:11:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15007 states. [2024-11-11 21:11:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15007 to 11058. [2024-11-11 21:11:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11058 states, 10195 states have (on average 1.5252574791564493) internal successors, (15550), 10228 states have internal predecessors, (15550), 632 states have call successors, (632), 198 states have call predecessors, (632), 230 states have return successors, (907), 663 states have call predecessors, (907), 632 states have call successors, (907) [2024-11-11 21:11:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11058 states to 11058 states and 17089 transitions. [2024-11-11 21:11:22,038 INFO L78 Accepts]: Start accepts. Automaton has 11058 states and 17089 transitions. Word has length 175 [2024-11-11 21:11:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:22,038 INFO L471 AbstractCegarLoop]: Abstraction has 11058 states and 17089 transitions. [2024-11-11 21:11:22,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 11058 states and 17089 transitions. [2024-11-11 21:11:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:11:22,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:22,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:22,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:11:22,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:22,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1210556159, now seen corresponding path program 1 times [2024-11-11 21:11:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:22,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227715340] [2024-11-11 21:11:22,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:11:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:22,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:11:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:22,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:22,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:11:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:22,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:11:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:22,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227715340] [2024-11-11 21:11:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227715340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:22,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:22,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117508838] [2024-11-11 21:11:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:22,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:22,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:22,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:22,291 INFO L87 Difference]: Start difference. First operand 11058 states and 17089 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:26,826 INFO L93 Difference]: Finished difference Result 40112 states and 62873 transitions. [2024-11-11 21:11:26,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:11:26,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:26,916 INFO L225 Difference]: With dead ends: 40112 [2024-11-11 21:11:26,916 INFO L226 Difference]: Without dead ends: 29073 [2024-11-11 21:11:26,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:11:26,950 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1554 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 4084 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 4145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:26,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 2391 Invalid, 4145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4084 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 21:11:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29073 states. [2024-11-11 21:11:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29073 to 21847. [2024-11-11 21:11:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21847 states, 20152 states have (on average 1.5240174672489082) internal successors, (30712), 20217 states have internal predecessors, (30712), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 454 states have return successors, (2033), 1303 states have call predecessors, (2033), 1240 states have call successors, (2033) [2024-11-11 21:11:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21847 states to 21847 states and 33985 transitions. [2024-11-11 21:11:28,232 INFO L78 Accepts]: Start accepts. Automaton has 21847 states and 33985 transitions. Word has length 175 [2024-11-11 21:11:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:28,233 INFO L471 AbstractCegarLoop]: Abstraction has 21847 states and 33985 transitions. [2024-11-11 21:11:28,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 21847 states and 33985 transitions. [2024-11-11 21:11:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:11:28,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:28,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:28,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:11:28,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:28,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:28,257 INFO L85 PathProgramCache]: Analyzing trace with hash -112622787, now seen corresponding path program 1 times [2024-11-11 21:11:28,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:28,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189505342] [2024-11-11 21:11:28,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:28,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:11:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:11:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:11:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:11:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:28,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189505342] [2024-11-11 21:11:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189505342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:28,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797735878] [2024-11-11 21:11:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:28,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:28,470 INFO L87 Difference]: Start difference. First operand 21847 states and 33985 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:34,259 INFO L93 Difference]: Finished difference Result 79127 states and 124847 transitions. [2024-11-11 21:11:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:11:34,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:34,475 INFO L225 Difference]: With dead ends: 79127 [2024-11-11 21:11:34,475 INFO L226 Difference]: Without dead ends: 57299 [2024-11-11 21:11:34,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:11:34,530 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1553 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 4071 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 4132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:34,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 2391 Invalid, 4132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4071 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 21:11:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57299 states. [2024-11-11 21:11:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57299 to 43484. [2024-11-11 21:11:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43484 states, 40125 states have (on average 1.5232897196261683) internal successors, (61122), 40254 states have internal predecessors, (61122), 2456 states have call successors, (2456), 774 states have call predecessors, (2456), 902 states have return successors, (4771), 2583 states have call predecessors, (4771), 2456 states have call successors, (4771) [2024-11-11 21:11:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43484 states to 43484 states and 68349 transitions. [2024-11-11 21:11:37,622 INFO L78 Accepts]: Start accepts. Automaton has 43484 states and 68349 transitions. Word has length 175 [2024-11-11 21:11:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:37,623 INFO L471 AbstractCegarLoop]: Abstraction has 43484 states and 68349 transitions. [2024-11-11 21:11:37,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 43484 states and 68349 transitions. [2024-11-11 21:11:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:11:37,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:37,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:37,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:11:37,679 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:37,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1784356671, now seen corresponding path program 1 times [2024-11-11 21:11:37,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:37,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255782511] [2024-11-11 21:11:37,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:11:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:11:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:11:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:11:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:37,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:37,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255782511] [2024-11-11 21:11:37,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255782511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:37,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:37,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:37,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269733311] [2024-11-11 21:11:37,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:37,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:37,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:37,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:37,901 INFO L87 Difference]: Start difference. First operand 43484 states and 68349 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:46,033 INFO L93 Difference]: Finished difference Result 157154 states and 250637 transitions. [2024-11-11 21:11:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:11:46,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:46,478 INFO L225 Difference]: With dead ends: 157154 [2024-11-11 21:11:46,479 INFO L226 Difference]: Without dead ends: 113689 [2024-11-11 21:11:46,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:11:46,601 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1552 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 4058 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 4119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:46,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 2391 Invalid, 4119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4058 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 21:11:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113689 states. [2024-11-11 21:11:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113689 to 86885. [2024-11-11 21:11:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86885 states, 80198 states have (on average 1.5228808698471283) internal successors, (122132), 80455 states have internal predecessors, (122132), 4888 states have call successors, (4888), 1542 states have call predecessors, (4888), 1798 states have return successors, (11705), 5143 states have call predecessors, (11705), 4888 states have call successors, (11705) [2024-11-11 21:11:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86885 states to 86885 states and 138725 transitions. [2024-11-11 21:11:51,757 INFO L78 Accepts]: Start accepts. Automaton has 86885 states and 138725 transitions. Word has length 175 [2024-11-11 21:11:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:51,757 INFO L471 AbstractCegarLoop]: Abstraction has 86885 states and 138725 transitions. [2024-11-11 21:11:51,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 86885 states and 138725 transitions. [2024-11-11 21:11:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:11:52,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:52,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:52,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:11:52,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2122644221, now seen corresponding path program 1 times [2024-11-11 21:11:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859520938] [2024-11-11 21:11:52,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:11:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:11:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:52,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:11:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 21:11:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:52,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:52,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859520938] [2024-11-11 21:11:52,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859520938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:52,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:52,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096083525] [2024-11-11 21:11:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:52,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:52,376 INFO L87 Difference]: Start difference. First operand 86885 states and 138725 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:11:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:58,561 INFO L93 Difference]: Finished difference Result 201884 states and 329932 transitions. [2024-11-11 21:11:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:11:58,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 5 states have internal predecessors, (165), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 175 [2024-11-11 21:11:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:58,948 INFO L225 Difference]: With dead ends: 201884 [2024-11-11 21:11:58,948 INFO L226 Difference]: Without dead ends: 115018 [2024-11-11 21:11:59,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:11:59,297 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 1209 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:59,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 999 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 21:11:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115018 states.