./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-2.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 6ba9401cadb8fecd59a1a331c94e3215cc972a92f03516bfd6c95164e3ec98a9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:23:39,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:23:39,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:23:39,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:23:39,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:23:39,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:23:39,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:23:39,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:23:39,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:23:39,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:23:39,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:23:39,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:23:39,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:23:39,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:23:39,555 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:23:39,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:23:39,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:23:39,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:23:39,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:23:39,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:23:39,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:23:39,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:23:39,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:23:39,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:23:39,559 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:23:39,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:23:39,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:23:39,560 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:23:39,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:23:39,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:23:39,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:23:39,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:23:39,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:23:39,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:23:39,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:23:39,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:23:39,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:23:39,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:23:39,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:23:39,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:23:39,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:23:39,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:23:39,565 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 -> 6ba9401cadb8fecd59a1a331c94e3215cc972a92f03516bfd6c95164e3ec98a9 [2024-10-14 03:23:39,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:23:39,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:23:39,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:23:39,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:23:39,863 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:23:39,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-2.c [2024-10-14 03:23:41,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:23:41,557 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:23:41,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-2.c [2024-10-14 03:23:41,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c23d97cb/7ae7b7c5ddc7440180620a0b37dbca14/FLAG3ed9f0db9 [2024-10-14 03:23:41,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c23d97cb/7ae7b7c5ddc7440180620a0b37dbca14 [2024-10-14 03:23:41,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:23:41,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:23:41,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:23:41,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:23:41,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:23:41,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:23:41" (1/1) ... [2024-10-14 03:23:41,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648ec816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:41, skipping insertion in model container [2024-10-14 03:23:41,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:23:41" (1/1) ... [2024-10-14 03:23:41,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:23:41,817 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-2.c[671,684] [2024-10-14 03:23:41,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:23:41,975 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:23:41,990 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-2.c[671,684] [2024-10-14 03:23:42,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:23:42,127 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:23:42,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42 WrapperNode [2024-10-14 03:23:42,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:23:42,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:23:42,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:23:42,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:23:42,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,195 INFO L138 Inliner]: procedures = 48, calls = 61, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 759 [2024-10-14 03:23:42,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:23:42,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:23:42,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:23:42,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:23:42,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,235 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:23:42,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:23:42,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:23:42,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:23:42,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:23:42,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (1/1) ... [2024-10-14 03:23:42,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:23:42,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:23:42,322 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-10-14 03:23:42,328 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-10-14 03:23:42,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:23:42,375 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:23:42,376 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:23:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:23:42,376 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:23:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:23:42,376 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:23:42,377 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:23:42,377 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:23:42,377 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:23:42,377 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:23:42,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:23:42,377 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:23:42,377 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:23:42,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:23:42,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:23:42,508 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:23:42,509 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:23:43,315 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-10-14 03:23:43,316 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:23:43,402 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:23:43,402 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-14 03:23:43,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:43 BoogieIcfgContainer [2024-10-14 03:23:43,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:23:43,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:23:43,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:23:43,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:23:43,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:23:41" (1/3) ... [2024-10-14 03:23:43,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273e439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:43, skipping insertion in model container [2024-10-14 03:23:43,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:42" (2/3) ... [2024-10-14 03:23:43,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273e439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:43, skipping insertion in model container [2024-10-14 03:23:43,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:43" (3/3) ... [2024-10-14 03:23:43,412 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.10.cil-2.c [2024-10-14 03:23:43,427 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:23:43,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:23:43,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:23:43,512 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;@1de78860, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:23:43,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:23:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 270 states have (on average 1.7296296296296296) internal successors, (467), 272 states have internal predecessors, (467), 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-10-14 03:23:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:23:43,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:43,534 INFO L215 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] [2024-10-14 03:23:43,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:43,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash 149152853, now seen corresponding path program 1 times [2024-10-14 03:23:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459969990] [2024-10-14 03:23:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:23:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:23:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:23:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:23:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:44,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459969990] [2024-10-14 03:23:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459969990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:44,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:44,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:23:44,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485002718] [2024-10-14 03:23:44,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:44,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:23:44,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:44,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:23:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:23:44,235 INFO L87 Difference]: Start difference. First operand has 302 states, 270 states have (on average 1.7296296296296296) internal successors, (467), 272 states have internal predecessors, (467), 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 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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-10-14 03:23:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:46,136 INFO L93 Difference]: Finished difference Result 710 states and 1221 transitions. [2024-10-14 03:23:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:23:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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 140 [2024-10-14 03:23:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:46,152 INFO L225 Difference]: With dead ends: 710 [2024-10-14 03:23:46,152 INFO L226 Difference]: Without dead ends: 410 [2024-10-14 03:23:46,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-10-14 03:23:46,161 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 837 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:46,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 543 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:23:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-14 03:23:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 300. [2024-10-14 03:23:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.6245353159851301) internal successors, (437), 270 states have internal predecessors, (437), 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-10-14 03:23:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 485 transitions. [2024-10-14 03:23:46,247 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 485 transitions. Word has length 140 [2024-10-14 03:23:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:46,249 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 485 transitions. [2024-10-14 03:23:46,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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-10-14 03:23:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 485 transitions. [2024-10-14 03:23:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:23:46,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:46,255 INFO L215 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] [2024-10-14 03:23:46,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:23:46,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:46,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1249800749, now seen corresponding path program 1 times [2024-10-14 03:23:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522884011] [2024-10-14 03:23:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:23:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:23:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:46,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:23:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:46,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:23:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:46,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:46,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522884011] [2024-10-14 03:23:46,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522884011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:46,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:46,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:23:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228402907] [2024-10-14 03:23:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:46,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:23:46,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:46,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:23:46,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:23:46,539 INFO L87 Difference]: Start difference. First operand 300 states and 485 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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-10-14 03:23:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:48,069 INFO L93 Difference]: Finished difference Result 698 states and 1146 transitions. [2024-10-14 03:23:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:23:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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 140 [2024-10-14 03:23:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:48,078 INFO L225 Difference]: With dead ends: 698 [2024-10-14 03:23:48,078 INFO L226 Difference]: Without dead ends: 410 [2024-10-14 03:23:48,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:23:48,084 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 826 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:48,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 538 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:23:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-14 03:23:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 300. [2024-10-14 03:23:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.620817843866171) internal successors, (436), 270 states have internal predecessors, (436), 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-10-14 03:23:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 484 transitions. [2024-10-14 03:23:48,115 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 484 transitions. Word has length 140 [2024-10-14 03:23:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:48,115 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 484 transitions. [2024-10-14 03:23:48,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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-10-14 03:23:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 484 transitions. [2024-10-14 03:23:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:23:48,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:48,118 INFO L215 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] [2024-10-14 03:23:48,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:23:48,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:48,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash -815295151, now seen corresponding path program 1 times [2024-10-14 03:23:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233418565] [2024-10-14 03:23:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:23:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:23:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:23:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:23:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:48,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233418565] [2024-10-14 03:23:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233418565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:48,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:48,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:23:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816881685] [2024-10-14 03:23:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:48,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:23:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:23:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:23:48,447 INFO L87 Difference]: Start difference. First operand 300 states and 484 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 4 states have internal predecessors, (130), 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-10-14 03:23:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:50,786 INFO L93 Difference]: Finished difference Result 1103 states and 1822 transitions. [2024-10-14 03:23:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:23:50,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 4 states have internal predecessors, (130), 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 140 [2024-10-14 03:23:50,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:50,791 INFO L225 Difference]: With dead ends: 1103 [2024-10-14 03:23:50,791 INFO L226 Difference]: Without dead ends: 819 [2024-10-14 03:23:50,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:50,794 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 1258 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:50,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 908 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 03:23:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-10-14 03:23:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 600. [2024-10-14 03:23:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 543 states have (on average 1.6316758747697975) internal successors, (886), 545 states have internal predecessors, (886), 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-10-14 03:23:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 975 transitions. [2024-10-14 03:23:50,849 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 975 transitions. Word has length 140 [2024-10-14 03:23:50,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:50,850 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 975 transitions. [2024-10-14 03:23:50,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 4 states have internal predecessors, (130), 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-10-14 03:23:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 975 transitions. [2024-10-14 03:23:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:23:50,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:50,855 INFO L215 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] [2024-10-14 03:23:50,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:23:50,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:50,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -416103919, now seen corresponding path program 1 times [2024-10-14 03:23:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:50,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362888889] [2024-10-14 03:23:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:50,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:51,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:23:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:51,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:23:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:23:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:23:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362888889] [2024-10-14 03:23:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362888889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:51,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:51,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274029233] [2024-10-14 03:23:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:51,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:51,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:51,150 INFO L87 Difference]: Start difference. First operand 600 states and 975 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:23:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:54,186 INFO L93 Difference]: Finished difference Result 1828 states and 3020 transitions. [2024-10-14 03:23:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:23:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:23:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:54,197 INFO L225 Difference]: With dead ends: 1828 [2024-10-14 03:23:54,198 INFO L226 Difference]: Without dead ends: 1244 [2024-10-14 03:23:54,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:23:54,201 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1287 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 3176 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:54,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1722 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3176 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 03:23:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-10-14 03:23:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 877. [2024-10-14 03:23:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 794 states have (on average 1.6246851385390428) internal successors, (1290), 797 states have internal predecessors, (1290), 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-10-14 03:23:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1419 transitions. [2024-10-14 03:23:54,279 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1419 transitions. Word has length 140 [2024-10-14 03:23:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:54,279 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1419 transitions. [2024-10-14 03:23:54,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:23:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1419 transitions. [2024-10-14 03:23:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:23:54,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:54,281 INFO L215 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] [2024-10-14 03:23:54,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:23:54,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:54,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:54,282 INFO L85 PathProgramCache]: Analyzing trace with hash 71943187, now seen corresponding path program 1 times [2024-10-14 03:23:54,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:54,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342075687] [2024-10-14 03:23:54,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:54,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:54,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:23:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:23:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:23:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:54,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:23:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:54,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:54,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342075687] [2024-10-14 03:23:54,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342075687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:54,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:54,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40059664] [2024-10-14 03:23:54,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:54,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:54,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:54,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:54,552 INFO L87 Difference]: Start difference. First operand 877 states and 1419 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:23:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:57,570 INFO L93 Difference]: Finished difference Result 2890 states and 4764 transitions. [2024-10-14 03:23:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:23:57,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:23:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:57,584 INFO L225 Difference]: With dead ends: 2890 [2024-10-14 03:23:57,584 INFO L226 Difference]: Without dead ends: 2029 [2024-10-14 03:23:57,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:23:57,591 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1387 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:57,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 1124 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2629 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 03:23:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2024-10-14 03:23:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1432. [2024-10-14 03:23:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1297 states have (on average 1.6183500385505012) internal successors, (2099), 1302 states have internal predecessors, (2099), 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-10-14 03:23:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2312 transitions. [2024-10-14 03:23:57,719 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2312 transitions. Word has length 140 [2024-10-14 03:23:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:57,719 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2312 transitions. [2024-10-14 03:23:57,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:23:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2312 transitions. [2024-10-14 03:23:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:23:57,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:57,722 INFO L215 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] [2024-10-14 03:23:57,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:23:57,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:57,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1020692015, now seen corresponding path program 1 times [2024-10-14 03:23:57,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:57,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693370484] [2024-10-14 03:23:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:57,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:23:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:23:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:23:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:23:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693370484] [2024-10-14 03:23:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693370484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801992951] [2024-10-14 03:23:57,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:57,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:57,975 INFO L87 Difference]: Start difference. First operand 1432 states and 2312 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:23:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:59,792 INFO L93 Difference]: Finished difference Result 3431 states and 5642 transitions. [2024-10-14 03:23:59,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:59,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:23:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:59,802 INFO L225 Difference]: With dead ends: 3431 [2024-10-14 03:23:59,803 INFO L226 Difference]: Without dead ends: 2015 [2024-10-14 03:23:59,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:59,810 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 925 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:59,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 882 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:23:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-10-14 03:23:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1432. [2024-10-14 03:23:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1297 states have (on average 1.6144949884348496) internal successors, (2094), 1302 states have internal predecessors, (2094), 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-10-14 03:23:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2307 transitions. [2024-10-14 03:23:59,935 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2307 transitions. Word has length 140 [2024-10-14 03:23:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:59,936 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2307 transitions. [2024-10-14 03:23:59,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:23:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2307 transitions. [2024-10-14 03:23:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:23:59,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:59,938 INFO L215 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] [2024-10-14 03:23:59,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:23:59,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:59,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:59,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1431799567, now seen corresponding path program 1 times [2024-10-14 03:23:59,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:59,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338089890] [2024-10-14 03:23:59,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:59,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:00,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:00,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:00,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:00,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:00,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:00,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338089890] [2024-10-14 03:24:00,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338089890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:00,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:00,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:00,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392640641] [2024-10-14 03:24:00,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:00,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:00,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:00,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:00,194 INFO L87 Difference]: Start difference. First operand 1432 states and 2307 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:01,705 INFO L93 Difference]: Finished difference Result 3425 states and 5615 transitions. [2024-10-14 03:24:01,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:01,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:24:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:01,718 INFO L225 Difference]: With dead ends: 3425 [2024-10-14 03:24:01,718 INFO L226 Difference]: Without dead ends: 2009 [2024-10-14 03:24:01,727 INFO L431 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-10-14 03:24:01,728 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1053 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:01,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 742 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:24:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2024-10-14 03:24:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1432. [2024-10-14 03:24:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1297 states have (on average 1.610639938319198) internal successors, (2089), 1302 states have internal predecessors, (2089), 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-10-14 03:24:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2302 transitions. [2024-10-14 03:24:01,845 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2302 transitions. Word has length 140 [2024-10-14 03:24:01,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:01,846 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2302 transitions. [2024-10-14 03:24:01,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2302 transitions. [2024-10-14 03:24:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:24:01,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:01,852 INFO L215 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] [2024-10-14 03:24:01,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:24:01,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:01,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash -290203119, now seen corresponding path program 1 times [2024-10-14 03:24:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:01,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585126580] [2024-10-14 03:24:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:01,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:01,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:02,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:02,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:02,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:02,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585126580] [2024-10-14 03:24:02,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585126580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:02,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:02,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:02,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272932212] [2024-10-14 03:24:02,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:02,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:02,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:02,131 INFO L87 Difference]: Start difference. First operand 1432 states and 2302 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:04,953 INFO L93 Difference]: Finished difference Result 4910 states and 8013 transitions. [2024-10-14 03:24:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:24:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:24:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:04,973 INFO L225 Difference]: With dead ends: 4910 [2024-10-14 03:24:04,974 INFO L226 Difference]: Without dead ends: 3494 [2024-10-14 03:24:04,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:24:04,980 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1271 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 3155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:04,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1720 Invalid, 3155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3096 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 03:24:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2024-10-14 03:24:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 2558. [2024-10-14 03:24:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2319 states have (on average 1.6045709357481672) internal successors, (3721), 2328 states have internal predecessors, (3721), 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-10-14 03:24:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4108 transitions. [2024-10-14 03:24:05,204 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 4108 transitions. Word has length 140 [2024-10-14 03:24:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:05,205 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 4108 transitions. [2024-10-14 03:24:05,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 4108 transitions. [2024-10-14 03:24:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:24:05,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:05,208 INFO L215 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] [2024-10-14 03:24:05,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:24:05,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash -622846257, now seen corresponding path program 1 times [2024-10-14 03:24:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555507893] [2024-10-14 03:24:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:05,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:05,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:05,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:05,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555507893] [2024-10-14 03:24:05,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555507893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:05,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602141300] [2024-10-14 03:24:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:05,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:05,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:05,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:05,453 INFO L87 Difference]: Start difference. First operand 2558 states and 4108 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:07,022 INFO L93 Difference]: Finished difference Result 6053 states and 9878 transitions. [2024-10-14 03:24:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:24:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:07,040 INFO L225 Difference]: With dead ends: 6053 [2024-10-14 03:24:07,040 INFO L226 Difference]: Without dead ends: 3511 [2024-10-14 03:24:07,048 INFO L431 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-10-14 03:24:07,051 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 922 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:07,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 882 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:24:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2024-10-14 03:24:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 2558. [2024-10-14 03:24:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2319 states have (on average 1.6006899525657612) internal successors, (3712), 2328 states have internal predecessors, (3712), 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-10-14 03:24:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4099 transitions. [2024-10-14 03:24:07,327 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 4099 transitions. Word has length 140 [2024-10-14 03:24:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:07,328 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 4099 transitions. [2024-10-14 03:24:07,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 4099 transitions. [2024-10-14 03:24:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:24:07,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:07,331 INFO L215 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] [2024-10-14 03:24:07,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:24:07,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:07,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1306085969, now seen corresponding path program 1 times [2024-10-14 03:24:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271431424] [2024-10-14 03:24:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:07,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:07,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271431424] [2024-10-14 03:24:07,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271431424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:07,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:07,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:07,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012679694] [2024-10-14 03:24:07,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:07,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:07,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:07,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:07,556 INFO L87 Difference]: Start difference. First operand 2558 states and 4099 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:10,624 INFO L93 Difference]: Finished difference Result 8976 states and 14581 transitions. [2024-10-14 03:24:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:24:10,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:24:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:10,659 INFO L225 Difference]: With dead ends: 8976 [2024-10-14 03:24:10,659 INFO L226 Difference]: Without dead ends: 6434 [2024-10-14 03:24:10,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:24:10,668 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1263 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:10,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 1720 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 03:24:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6434 states. [2024-10-14 03:24:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6434 to 4820. [2024-10-14 03:24:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4820 states, 4373 states have (on average 1.5952435399039562) internal successors, (6976), 4390 states have internal predecessors, (6976), 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-10-14 03:24:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4820 states to 4820 states and 7729 transitions. [2024-10-14 03:24:11,017 INFO L78 Accepts]: Start accepts. Automaton has 4820 states and 7729 transitions. Word has length 140 [2024-10-14 03:24:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:11,018 INFO L471 AbstractCegarLoop]: Abstraction has 4820 states and 7729 transitions. [2024-10-14 03:24:11,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4820 states and 7729 transitions. [2024-10-14 03:24:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:24:11,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:11,023 INFO L215 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] [2024-10-14 03:24:11,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:24:11,023 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:11,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash -986995057, now seen corresponding path program 1 times [2024-10-14 03:24:11,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:11,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755677313] [2024-10-14 03:24:11,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:11,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:11,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:11,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755677313] [2024-10-14 03:24:11,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755677313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:11,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:11,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:11,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774275792] [2024-10-14 03:24:11,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:11,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:11,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:11,250 INFO L87 Difference]: Start difference. First operand 4820 states and 7729 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:14,427 INFO L93 Difference]: Finished difference Result 17124 states and 27849 transitions. [2024-10-14 03:24:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:24:14,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:24:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:14,486 INFO L225 Difference]: With dead ends: 17124 [2024-10-14 03:24:14,487 INFO L226 Difference]: Without dead ends: 12320 [2024-10-14 03:24:14,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:24:14,505 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1262 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 3045 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:14,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 1720 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3045 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 03:24:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12320 states. [2024-10-14 03:24:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12320 to 9357. [2024-10-14 03:24:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9357 states, 8494 states have (on average 1.5919472568872146) internal successors, (13522), 8527 states have internal predecessors, (13522), 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-10-14 03:24:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9357 states to 9357 states and 15061 transitions. [2024-10-14 03:24:15,219 INFO L78 Accepts]: Start accepts. Automaton has 9357 states and 15061 transitions. Word has length 140 [2024-10-14 03:24:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:15,219 INFO L471 AbstractCegarLoop]: Abstraction has 9357 states and 15061 transitions. [2024-10-14 03:24:15,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 9357 states and 15061 transitions. [2024-10-14 03:24:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:24:15,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:15,234 INFO L215 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] [2024-10-14 03:24:15,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:24:15,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:15,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash 740149905, now seen corresponding path program 1 times [2024-10-14 03:24:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:15,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585584476] [2024-10-14 03:24:15,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:15,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:15,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:15,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:15,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585584476] [2024-10-14 03:24:15,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585584476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:15,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:15,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:15,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739489066] [2024-10-14 03:24:15,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:15,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:15,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:15,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:15,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:15,549 INFO L87 Difference]: Start difference. First operand 9357 states and 15061 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:19,115 INFO L93 Difference]: Finished difference Result 33419 states and 54575 transitions. [2024-10-14 03:24:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:24:19,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:24:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:19,220 INFO L225 Difference]: With dead ends: 33419 [2024-10-14 03:24:19,220 INFO L226 Difference]: Without dead ends: 24078 [2024-10-14 03:24:19,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:24:19,259 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1348 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:19,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 1124 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 03:24:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24078 states. [2024-10-14 03:24:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24078 to 18462. [2024-10-14 03:24:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18462 states, 16767 states have (on average 1.5900280312518638) internal successors, (26660), 16832 states have internal predecessors, (26660), 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-10-14 03:24:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 29933 transitions. [2024-10-14 03:24:20,965 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 29933 transitions. Word has length 140 [2024-10-14 03:24:20,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:20,966 INFO L471 AbstractCegarLoop]: Abstraction has 18462 states and 29933 transitions. [2024-10-14 03:24:20,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 29933 transitions. [2024-10-14 03:24:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:24:20,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:20,979 INFO L215 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] [2024-10-14 03:24:20,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:24:20,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:20,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1211506255, now seen corresponding path program 1 times [2024-10-14 03:24:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253807849] [2024-10-14 03:24:20,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:21,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:21,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:21,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:21,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:21,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253807849] [2024-10-14 03:24:21,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253807849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:21,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:21,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:21,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329910414] [2024-10-14 03:24:21,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:21,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:21,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:21,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:21,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:21,196 INFO L87 Difference]: Start difference. First operand 18462 states and 29933 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:27,185 INFO L93 Difference]: Finished difference Result 73432 states and 120723 transitions. [2024-10-14 03:24:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:24:27,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:24:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:27,405 INFO L225 Difference]: With dead ends: 73432 [2024-10-14 03:24:27,405 INFO L226 Difference]: Without dead ends: 54986 [2024-10-14 03:24:27,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:24:27,468 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 1344 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 3554 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 3615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:27,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1709 Invalid, 3615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3554 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 03:24:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54986 states. [2024-10-14 03:24:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54986 to 36352. [2024-10-14 03:24:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36352 states, 33057 states have (on average 1.5907069607042381) internal successors, (52584), 33186 states have internal predecessors, (52584), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 902 states have return successors, (4707), 2519 states have call predecessors, (4707), 2392 states have call successors, (4707) [2024-10-14 03:24:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36352 states to 36352 states and 59683 transitions. [2024-10-14 03:24:30,092 INFO L78 Accepts]: Start accepts. Automaton has 36352 states and 59683 transitions. Word has length 140 [2024-10-14 03:24:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:30,093 INFO L471 AbstractCegarLoop]: Abstraction has 36352 states and 59683 transitions. [2024-10-14 03:24:30,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 36352 states and 59683 transitions. [2024-10-14 03:24:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:24:30,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:30,120 INFO L215 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] [2024-10-14 03:24:30,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:24:30,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:30,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash -919844467, now seen corresponding path program 1 times [2024-10-14 03:24:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:30,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793332993] [2024-10-14 03:24:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:30,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:30,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793332993] [2024-10-14 03:24:30,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793332993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:30,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:30,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238033161] [2024-10-14 03:24:30,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:30,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:30,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:30,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:30,351 INFO L87 Difference]: Start difference. First operand 36352 states and 59683 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:34,716 INFO L93 Difference]: Finished difference Result 83925 states and 140563 transitions. [2024-10-14 03:24:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:24:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:35,068 INFO L225 Difference]: With dead ends: 83925 [2024-10-14 03:24:35,068 INFO L226 Difference]: Without dead ends: 47589 [2024-10-14 03:24:35,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:24:35,156 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 926 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:35,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 881 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:24:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47589 states. [2024-10-14 03:24:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47589 to 36352. [2024-10-14 03:24:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36352 states, 33057 states have (on average 1.5868046102187132) internal successors, (52455), 33186 states have internal predecessors, (52455), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 902 states have return successors, (4707), 2519 states have call predecessors, (4707), 2392 states have call successors, (4707) [2024-10-14 03:24:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36352 states to 36352 states and 59554 transitions. [2024-10-14 03:24:38,422 INFO L78 Accepts]: Start accepts. Automaton has 36352 states and 59554 transitions. Word has length 140 [2024-10-14 03:24:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:38,423 INFO L471 AbstractCegarLoop]: Abstraction has 36352 states and 59554 transitions. [2024-10-14 03:24:38,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 36352 states and 59554 transitions. [2024-10-14 03:24:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:24:38,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:38,450 INFO L215 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] [2024-10-14 03:24:38,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:24:38,450 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:38,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1958429041, now seen corresponding path program 1 times [2024-10-14 03:24:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:38,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208357401] [2024-10-14 03:24:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:38,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:38,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:38,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:38,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:38,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208357401] [2024-10-14 03:24:38,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208357401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:38,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:38,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:38,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957717193] [2024-10-14 03:24:38,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:38,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:38,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:38,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:38,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:38,662 INFO L87 Difference]: Start difference. First operand 36352 states and 59554 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:47,182 INFO L93 Difference]: Finished difference Result 141686 states and 235155 transitions. [2024-10-14 03:24:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:24:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-14 03:24:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:47,859 INFO L225 Difference]: With dead ends: 141686 [2024-10-14 03:24:47,859 INFO L226 Difference]: Without dead ends: 105350 [2024-10-14 03:24:47,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:24:47,940 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 1513 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 2952 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:47,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 1713 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2952 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 03:24:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105350 states. [2024-10-14 03:24:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105350 to 72578. [2024-10-14 03:24:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72578 states, 66147 states have (on average 1.5864513885739338) internal successors, (104939), 66404 states have internal predecessors, (104939), 4632 states have call successors, (4632), 1542 states have call predecessors, (4632), 1798 states have return successors, (11449), 4887 states have call predecessors, (11449), 4632 states have call successors, (11449) [2024-10-14 03:24:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72578 states to 72578 states and 121020 transitions. [2024-10-14 03:24:53,141 INFO L78 Accepts]: Start accepts. Automaton has 72578 states and 121020 transitions. Word has length 140 [2024-10-14 03:24:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:53,142 INFO L471 AbstractCegarLoop]: Abstraction has 72578 states and 121020 transitions. [2024-10-14 03:24:53,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-10-14 03:24:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 72578 states and 121020 transitions. [2024-10-14 03:24:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 03:24:53,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:53,188 INFO L215 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] [2024-10-14 03:24:53,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:24:53,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 363372877, now seen corresponding path program 1 times [2024-10-14 03:24:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:53,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164971324] [2024-10-14 03:24:53,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:53,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:24:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:24:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:24:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:53,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:24:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:24:53,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164971324] [2024-10-14 03:24:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164971324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:53,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:53,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:53,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392255894] [2024-10-14 03:24:53,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:53,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:53,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:53,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:53,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:53,398 INFO L87 Difference]: Start difference. First operand 72578 states and 121020 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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)