./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.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:13:41,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:13:41,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:13:41,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:13:41,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:13:41,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:13:41,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:13:41,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:13:41,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:13:41,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:13:41,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:13:41,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:13:41,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:13:41,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:13:41,487 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:13:41,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:13:41,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:13:41,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:13:41,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:13:41,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:13:41,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:13:41,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:13:41,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:13:41,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:13:41,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:13:41,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:13:41,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:13:41,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:13:41,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:13:41,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:13:41,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:13:41,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:13:41,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:13:41,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:13:41,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:13:41,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:13:41,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:13:41,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:13:41,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:13:41,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:13:41,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:13:41,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:13:41,498 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 [2024-10-11 03:13:41,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:13:41,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:13:41,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:13:41,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:13:41,727 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:13:41,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-10-11 03:13:42,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:13:43,117 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:13:43,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-10-11 03:13:43,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d9b040174/78ce885a0e194861975797b3e9fdf92d/FLAG3401f7702 [2024-10-11 03:13:43,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d9b040174/78ce885a0e194861975797b3e9fdf92d [2024-10-11 03:13:43,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:13:43,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:13:43,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:13:43,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:13:43,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:13:43,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6877cb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43, skipping insertion in model container [2024-10-11 03:13:43,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:13:43,347 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.06.cil-2.c[671,684] [2024-10-11 03:13:43,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:13:43,442 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:13:43,452 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.06.cil-2.c[671,684] [2024-10-11 03:13:43,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:13:43,511 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:13:43,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43 WrapperNode [2024-10-11 03:13:43,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:13:43,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:13:43,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:13:43,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:13:43,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,554 INFO L138 Inliner]: procedures = 40, calls = 49, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 519 [2024-10-11 03:13:43,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:13:43,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:13:43,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:13:43,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:13:43,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,586 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:13:43,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:13:43,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:13:43,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:13:43,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:13:43,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (1/1) ... [2024-10-11 03:13:43,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:13:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:43,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:13:43,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:13:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:13:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:13:43,688 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:13:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:13:43,688 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:13:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 03:13:43,688 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 03:13:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:13:43,689 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:13:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:13:43,689 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:13:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:13:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:13:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:13:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:13:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:13:43,762 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:13:43,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:13:44,256 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-11 03:13:44,256 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:13:44,297 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:13:44,299 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-11 03:13:44,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:13:44 BoogieIcfgContainer [2024-10-11 03:13:44,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:13:44,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:13:44,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:13:44,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:13:44,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:13:43" (1/3) ... [2024-10-11 03:13:44,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cab1cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:13:44, skipping insertion in model container [2024-10-11 03:13:44,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:43" (2/3) ... [2024-10-11 03:13:44,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cab1cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:13:44, skipping insertion in model container [2024-10-11 03:13:44,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:13:44" (3/3) ... [2024-10-11 03:13:44,307 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-2.c [2024-10-11 03:13:44,323 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:13:44,324 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:13:44,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:13:44,399 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;@58c8bc96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:13:44,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:13:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 182 states have (on average 1.7087912087912087) internal successors, (311), 184 states have internal predecessors, (311), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 03:13:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:44,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:44,416 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] [2024-10-11 03:13:44,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:44,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash -938107551, now seen corresponding path program 1 times [2024-10-11 03:13:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639775089] [2024-10-11 03:13:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:44,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:44,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:44,844 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-11 03:13:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:44,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639775089] [2024-10-11 03:13:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639775089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:44,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:13:44,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492079487] [2024-10-11 03:13:44,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:44,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:13:44,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:44,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:13:44,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:13:44,891 INFO L87 Difference]: Start difference. First operand has 210 states, 182 states have (on average 1.7087912087912087) internal successors, (311), 184 states have internal predecessors, (311), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11 03:13:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:45,835 INFO L93 Difference]: Finished difference Result 486 states and 821 transitions. [2024-10-11 03:13:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:13:45,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 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 100 [2024-10-11 03:13:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:45,848 INFO L225 Difference]: With dead ends: 486 [2024-10-11 03:13:45,848 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 03:13:45,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:13:45,857 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 553 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:45,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 379 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:13:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 03:13:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 208. [2024-10-11 03:13:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.5966850828729282) internal successors, (289), 182 states have internal predecessors, (289), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 03:13:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 329 transitions. [2024-10-11 03:13:45,933 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 329 transitions. Word has length 100 [2024-10-11 03:13:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:45,933 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 329 transitions. [2024-10-11 03:13:45,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 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-11 03:13:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 329 transitions. [2024-10-11 03:13:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:45,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:45,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] [2024-10-11 03:13:45,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:13:45,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:45,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2005474527, now seen corresponding path program 1 times [2024-10-11 03:13:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656221069] [2024-10-11 03:13:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:46,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:46,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:46,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:46,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:46,193 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-11 03:13:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:46,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656221069] [2024-10-11 03:13:46,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656221069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:46,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:46,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:13:46,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362341744] [2024-10-11 03:13:46,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:46,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:13:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:13:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:13:46,197 INFO L87 Difference]: Start difference. First operand 208 states and 329 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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-11 03:13:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:47,452 INFO L93 Difference]: Finished difference Result 747 states and 1211 transitions. [2024-10-11 03:13:47,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:13:47,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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 100 [2024-10-11 03:13:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:47,461 INFO L225 Difference]: With dead ends: 747 [2024-10-11 03:13:47,462 INFO L226 Difference]: Without dead ends: 551 [2024-10-11 03:13:47,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:13:47,464 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 823 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:47,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 631 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:13:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-11 03:13:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 412. [2024-10-11 03:13:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 363 states have (on average 1.606060606060606) internal successors, (583), 365 states have internal predecessors, (583), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-10-11 03:13:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 656 transitions. [2024-10-11 03:13:47,533 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 656 transitions. Word has length 100 [2024-10-11 03:13:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:47,533 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 656 transitions. [2024-10-11 03:13:47,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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-11 03:13:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 656 transitions. [2024-10-11 03:13:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:47,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:47,536 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] [2024-10-11 03:13:47,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:13:47,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:47,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash 748499615, now seen corresponding path program 1 times [2024-10-11 03:13:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:47,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236064233] [2024-10-11 03:13:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:47,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,708 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-11 03:13:47,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:47,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236064233] [2024-10-11 03:13:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236064233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699716779] [2024-10-11 03:13:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:47,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:47,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:47,714 INFO L87 Difference]: Start difference. First operand 412 states and 656 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:49,375 INFO L93 Difference]: Finished difference Result 1232 states and 1993 transitions. [2024-10-11 03:13:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:13:49,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:13:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:49,380 INFO L225 Difference]: With dead ends: 1232 [2024-10-11 03:13:49,380 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 03:13:49,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:13:49,382 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 836 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:49,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1186 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:13:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 03:13:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 601. [2024-10-11 03:13:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 530 states have (on average 1.5981132075471698) internal successors, (847), 533 states have internal predecessors, (847), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-11 03:13:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 952 transitions. [2024-10-11 03:13:49,438 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 952 transitions. Word has length 100 [2024-10-11 03:13:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:49,439 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 952 transitions. [2024-10-11 03:13:49,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 952 transitions. [2024-10-11 03:13:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:49,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:49,445 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] [2024-10-11 03:13:49,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:13:49,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:49,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1669984863, now seen corresponding path program 1 times [2024-10-11 03:13:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:49,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502874192] [2024-10-11 03:13:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:49,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:49,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:49,638 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-11 03:13:49,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:49,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502874192] [2024-10-11 03:13:49,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502874192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:49,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:49,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:49,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226847354] [2024-10-11 03:13:49,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:49,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:49,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:49,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:49,640 INFO L87 Difference]: Start difference. First operand 601 states and 952 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:51,112 INFO L93 Difference]: Finished difference Result 1942 states and 3133 transitions. [2024-10-11 03:13:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:13:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:13:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:51,121 INFO L225 Difference]: With dead ends: 1942 [2024-10-11 03:13:51,122 INFO L226 Difference]: Without dead ends: 1353 [2024-10-11 03:13:51,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:13:51,126 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 904 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:51,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 784 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:13:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-11 03:13:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 980. [2024-10-11 03:13:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 865 states have (on average 1.5907514450867053) internal successors, (1376), 870 states have internal predecessors, (1376), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-11 03:13:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1549 transitions. [2024-10-11 03:13:51,185 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1549 transitions. Word has length 100 [2024-10-11 03:13:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:51,185 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1549 transitions. [2024-10-11 03:13:51,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1549 transitions. [2024-10-11 03:13:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:51,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:51,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] [2024-10-11 03:13:51,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:13:51,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash 745851487, now seen corresponding path program 1 times [2024-10-11 03:13:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416201680] [2024-10-11 03:13:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:51,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:51,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:51,363 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-11 03:13:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416201680] [2024-10-11 03:13:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416201680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103597240] [2024-10-11 03:13:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:51,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:51,365 INFO L87 Difference]: Start difference. First operand 980 states and 1549 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:52,112 INFO L93 Difference]: Finished difference Result 2307 states and 3715 transitions. [2024-10-11 03:13:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:13:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:13:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:52,117 INFO L225 Difference]: With dead ends: 2307 [2024-10-11 03:13:52,117 INFO L226 Difference]: Without dead ends: 1339 [2024-10-11 03:13:52,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:13:52,120 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 700 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:52,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 505 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:13:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-10-11 03:13:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 980. [2024-10-11 03:13:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 865 states have (on average 1.584971098265896) internal successors, (1371), 870 states have internal predecessors, (1371), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-11 03:13:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1544 transitions. [2024-10-11 03:13:52,168 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1544 transitions. Word has length 100 [2024-10-11 03:13:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:52,168 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1544 transitions. [2024-10-11 03:13:52,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1544 transitions. [2024-10-11 03:13:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:52,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:52,170 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] [2024-10-11 03:13:52,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:13:52,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:52,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1982357859, now seen corresponding path program 1 times [2024-10-11 03:13:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:52,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486390621] [2024-10-11 03:13:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:52,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:52,280 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-11 03:13:52,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:52,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486390621] [2024-10-11 03:13:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486390621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:52,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148279507] [2024-10-11 03:13:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:52,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:52,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:52,282 INFO L87 Difference]: Start difference. First operand 980 states and 1544 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:52,967 INFO L93 Difference]: Finished difference Result 2301 states and 3688 transitions. [2024-10-11 03:13:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:13:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:13:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:52,973 INFO L225 Difference]: With dead ends: 2301 [2024-10-11 03:13:52,973 INFO L226 Difference]: Without dead ends: 1333 [2024-10-11 03:13:52,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:13:52,977 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 698 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:52,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 505 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:13:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-11 03:13:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 980. [2024-10-11 03:13:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 865 states have (on average 1.5791907514450867) internal successors, (1366), 870 states have internal predecessors, (1366), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-11 03:13:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1539 transitions. [2024-10-11 03:13:53,041 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1539 transitions. Word has length 100 [2024-10-11 03:13:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:53,041 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1539 transitions. [2024-10-11 03:13:53,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1539 transitions. [2024-10-11 03:13:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:53,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:53,042 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] [2024-10-11 03:13:53,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:13:53,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1254771359, now seen corresponding path program 1 times [2024-10-11 03:13:53,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:53,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244946055] [2024-10-11 03:13:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:53,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:53,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:53,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:53,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:53,183 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-11 03:13:53,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244946055] [2024-10-11 03:13:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244946055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:53,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:53,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:53,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330263697] [2024-10-11 03:13:53,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:53,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:53,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:53,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:53,186 INFO L87 Difference]: Start difference. First operand 980 states and 1539 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:54,662 INFO L93 Difference]: Finished difference Result 3290 states and 5238 transitions. [2024-10-11 03:13:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:13:54,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:13:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:54,670 INFO L225 Difference]: With dead ends: 3290 [2024-10-11 03:13:54,671 INFO L226 Difference]: Without dead ends: 2322 [2024-10-11 03:13:54,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:13:54,673 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 820 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:54,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1184 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:13:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2024-10-11 03:13:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 1754. [2024-10-11 03:13:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1551 states have (on average 1.5718891038039975) internal successors, (2438), 1560 states have internal predecessors, (2438), 140 states have call successors, (140), 54 states have call predecessors, (140), 62 states have return successors, (175), 147 states have call predecessors, (175), 140 states have call successors, (175) [2024-10-11 03:13:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2753 transitions. [2024-10-11 03:13:54,756 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2753 transitions. Word has length 100 [2024-10-11 03:13:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:54,756 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2753 transitions. [2024-10-11 03:13:54,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2753 transitions. [2024-10-11 03:13:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:54,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:54,758 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] [2024-10-11 03:13:54,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:13:54,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:54,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash 112268893, now seen corresponding path program 1 times [2024-10-11 03:13:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:54,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362167386] [2024-10-11 03:13:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:54,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:54,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:54,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:54,906 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-11 03:13:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362167386] [2024-10-11 03:13:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362167386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:54,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:54,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692960539] [2024-10-11 03:13:54,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:54,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:54,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:54,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:54,908 INFO L87 Difference]: Start difference. First operand 1754 states and 2753 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:56,484 INFO L93 Difference]: Finished difference Result 6662 states and 10600 transitions. [2024-10-11 03:13:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:13:56,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:13:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:56,501 INFO L225 Difference]: With dead ends: 6662 [2024-10-11 03:13:56,501 INFO L226 Difference]: Without dead ends: 4920 [2024-10-11 03:13:56,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:13:56,506 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1043 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:56,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1177 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:13:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2024-10-11 03:13:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 3287. [2024-10-11 03:13:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2916 states have (on average 1.5679012345679013) internal successors, (4572), 2933 states have internal predecessors, (4572), 252 states have call successors, (252), 102 states have call predecessors, (252), 118 states have return successors, (349), 267 states have call predecessors, (349), 252 states have call successors, (349) [2024-10-11 03:13:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 5173 transitions. [2024-10-11 03:13:56,689 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 5173 transitions. Word has length 100 [2024-10-11 03:13:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:56,689 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 5173 transitions. [2024-10-11 03:13:56,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 5173 transitions. [2024-10-11 03:13:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:56,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:56,692 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] [2024-10-11 03:13:56,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:13:56,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:56,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 352508639, now seen corresponding path program 1 times [2024-10-11 03:13:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:56,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522970567] [2024-10-11 03:13:56,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:56,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:56,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:56,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:56,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:56,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:56,818 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-11 03:13:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522970567] [2024-10-11 03:13:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522970567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:56,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:56,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306821429] [2024-10-11 03:13:56,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:56,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:56,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:56,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:56,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:56,820 INFO L87 Difference]: Start difference. First operand 3287 states and 5173 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:58,709 INFO L93 Difference]: Finished difference Result 12537 states and 19994 transitions. [2024-10-11 03:13:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:13:58,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:13:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:58,744 INFO L225 Difference]: With dead ends: 12537 [2024-10-11 03:13:58,744 INFO L226 Difference]: Without dead ends: 9262 [2024-10-11 03:13:58,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:13:58,755 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 864 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:58,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1173 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:13:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2024-10-11 03:13:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 6272. [2024-10-11 03:13:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 5573 states have (on average 1.5657635026018302) internal successors, (8726), 5606 states have internal predecessors, (8726), 468 states have call successors, (468), 198 states have call predecessors, (468), 230 states have return successors, (743), 499 states have call predecessors, (743), 468 states have call successors, (743) [2024-10-11 03:13:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 9937 transitions. [2024-10-11 03:13:59,117 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 9937 transitions. Word has length 100 [2024-10-11 03:13:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:59,118 INFO L471 AbstractCegarLoop]: Abstraction has 6272 states and 9937 transitions. [2024-10-11 03:13:59,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:13:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 9937 transitions. [2024-10-11 03:13:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:13:59,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:59,122 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] [2024-10-11 03:13:59,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:13:59,123 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:59,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:59,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1191542301, now seen corresponding path program 1 times [2024-10-11 03:13:59,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:59,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903275056] [2024-10-11 03:13:59,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:59,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:59,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:13:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:59,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:13:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:59,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:59,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:13:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:59,277 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-11 03:13:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903275056] [2024-10-11 03:13:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903275056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:59,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:59,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456553904] [2024-10-11 03:13:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:59,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:59,279 INFO L87 Difference]: Start difference. First operand 6272 states and 9937 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:14:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:00,248 INFO L93 Difference]: Finished difference Result 14361 states and 23119 transitions. [2024-10-11 03:14:00,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:00,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:14:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:00,295 INFO L225 Difference]: With dead ends: 14361 [2024-10-11 03:14:00,295 INFO L226 Difference]: Without dead ends: 8101 [2024-10-11 03:14:00,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:00,312 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 611 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:00,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 601 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:14:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8101 states. [2024-10-11 03:14:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8101 to 6272. [2024-10-11 03:14:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 5573 states have (on average 1.559842095819128) internal successors, (8693), 5606 states have internal predecessors, (8693), 468 states have call successors, (468), 198 states have call predecessors, (468), 230 states have return successors, (743), 499 states have call predecessors, (743), 468 states have call successors, (743) [2024-10-11 03:14:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 9904 transitions. [2024-10-11 03:14:00,758 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 9904 transitions. Word has length 100 [2024-10-11 03:14:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:00,758 INFO L471 AbstractCegarLoop]: Abstraction has 6272 states and 9904 transitions. [2024-10-11 03:14:00,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:14:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 9904 transitions. [2024-10-11 03:14:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:14:00,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:00,762 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] [2024-10-11 03:14:00,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:14:00,762 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:00,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:00,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1218607903, now seen corresponding path program 1 times [2024-10-11 03:14:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:00,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993976135] [2024-10-11 03:14:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:00,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:14:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:00,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:14:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:00,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:14:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:00,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:14:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:00,897 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-11 03:14:00,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:00,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993976135] [2024-10-11 03:14:00,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993976135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:00,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:00,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17036360] [2024-10-11 03:14:00,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:00,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:00,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:00,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:00,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:00,899 INFO L87 Difference]: Start difference. First operand 6272 states and 9904 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:14:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:02,909 INFO L93 Difference]: Finished difference Result 23406 states and 37392 transitions. [2024-10-11 03:14:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:14:02,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:14:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:02,968 INFO L225 Difference]: With dead ends: 23406 [2024-10-11 03:14:02,969 INFO L226 Difference]: Without dead ends: 17146 [2024-10-11 03:14:02,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:14:02,989 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 986 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:02,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 784 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:14:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17146 states. [2024-10-11 03:14:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17146 to 12354. [2024-10-11 03:14:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12354 states, 11015 states have (on average 1.5579664094416705) internal successors, (17161), 11080 states have internal predecessors, (17161), 884 states have call successors, (884), 390 states have call predecessors, (884), 454 states have return successors, (1677), 947 states have call predecessors, (1677), 884 states have call successors, (1677) [2024-10-11 03:14:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12354 states to 12354 states and 19722 transitions. [2024-10-11 03:14:03,798 INFO L78 Accepts]: Start accepts. Automaton has 12354 states and 19722 transitions. Word has length 100 [2024-10-11 03:14:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:03,798 INFO L471 AbstractCegarLoop]: Abstraction has 12354 states and 19722 transitions. [2024-10-11 03:14:03,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:14:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 12354 states and 19722 transitions. [2024-10-11 03:14:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:14:03,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:03,806 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] [2024-10-11 03:14:03,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:14:03,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:03,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash -858728995, now seen corresponding path program 1 times [2024-10-11 03:14:03,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:03,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089050563] [2024-10-11 03:14:03,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:03,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:03,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:14:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:14:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:14:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:03,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:14:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:03,910 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-11 03:14:03,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:03,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089050563] [2024-10-11 03:14:03,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089050563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:03,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:03,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884193798] [2024-10-11 03:14:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:03,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:03,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:03,912 INFO L87 Difference]: Start difference. First operand 12354 states and 19722 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:14:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:05,259 INFO L93 Difference]: Finished difference Result 27959 states and 45370 transitions. [2024-10-11 03:14:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:05,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:14:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:05,303 INFO L225 Difference]: With dead ends: 27959 [2024-10-11 03:14:05,303 INFO L226 Difference]: Without dead ends: 15617 [2024-10-11 03:14:05,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:05,327 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 614 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:05,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 601 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:14:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states. [2024-10-11 03:14:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 12354. [2024-10-11 03:14:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12354 states, 11015 states have (on average 1.5520653654108034) internal successors, (17096), 11080 states have internal predecessors, (17096), 884 states have call successors, (884), 390 states have call predecessors, (884), 454 states have return successors, (1677), 947 states have call predecessors, (1677), 884 states have call successors, (1677) [2024-10-11 03:14:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12354 states to 12354 states and 19657 transitions. [2024-10-11 03:14:06,286 INFO L78 Accepts]: Start accepts. Automaton has 12354 states and 19657 transitions. Word has length 100 [2024-10-11 03:14:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:06,287 INFO L471 AbstractCegarLoop]: Abstraction has 12354 states and 19657 transitions. [2024-10-11 03:14:06,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:14:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 12354 states and 19657 transitions. [2024-10-11 03:14:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:14:06,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:06,296 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] [2024-10-11 03:14:06,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:14:06,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash 28493851, now seen corresponding path program 1 times [2024-10-11 03:14:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731233156] [2024-10-11 03:14:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:06,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:14:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:06,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:14:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:06,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:14:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:14:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:06,440 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-11 03:14:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:06,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731233156] [2024-10-11 03:14:06,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731233156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:06,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:06,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326366879] [2024-10-11 03:14:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:06,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:06,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:06,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:06,443 INFO L87 Difference]: Start difference. First operand 12354 states and 19657 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:14:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:09,604 INFO L93 Difference]: Finished difference Result 43658 states and 70316 transitions. [2024-10-11 03:14:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:14:09,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-11 03:14:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:09,707 INFO L225 Difference]: With dead ends: 43658 [2024-10-11 03:14:09,707 INFO L226 Difference]: Without dead ends: 31316 [2024-10-11 03:14:09,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:14:09,740 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 803 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:09,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1177 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1987 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:14:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31316 states. [2024-10-11 03:14:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31316 to 24645. [2024-10-11 03:14:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24645 states, 22058 states have (on average 1.551455254329495) internal successors, (34222), 22187 states have internal predecessors, (34222), 1684 states have call successors, (1684), 774 states have call predecessors, (1684), 902 states have return successors, (3999), 1811 states have call predecessors, (3999), 1684 states have call successors, (3999) [2024-10-11 03:14:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24645 states to 24645 states and 39905 transitions. [2024-10-11 03:14:11,553 INFO L78 Accepts]: Start accepts. Automaton has 24645 states and 39905 transitions. Word has length 100 [2024-10-11 03:14:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:11,553 INFO L471 AbstractCegarLoop]: Abstraction has 24645 states and 39905 transitions. [2024-10-11 03:14:11,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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-11 03:14:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 24645 states and 39905 transitions. [2024-10-11 03:14:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:14:11,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:11,572 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] [2024-10-11 03:14:11,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:14:11,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:11,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1882548707, now seen corresponding path program 1 times [2024-10-11 03:14:11,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:11,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98727139] [2024-10-11 03:14:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:11,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:11,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:14:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:14:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:11,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:14:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:14:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:11,688 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-11 03:14:11,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:11,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98727139] [2024-10-11 03:14:11,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98727139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:11,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:11,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:14:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811990741] [2024-10-11 03:14:11,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:11,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:14:11,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:11,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:14:11,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:14:11,690 INFO L87 Difference]: Start difference. First operand 24645 states and 39905 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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-11 03:14:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:15,314 INFO L93 Difference]: Finished difference Result 70272 states and 113710 transitions. [2024-10-11 03:14:15,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:14:15,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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 100 [2024-10-11 03:14:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:15,440 INFO L225 Difference]: With dead ends: 70272 [2024-10-11 03:14:15,441 INFO L226 Difference]: Without dead ends: 45640 [2024-10-11 03:14:15,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:14:15,497 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1052 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:15,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 910 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:14:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45640 states. [2024-10-11 03:14:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45640 to 36885. [2024-10-11 03:14:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 32964 states have (on average 1.5430166241960928) internal successors, (50864), 33222 states have internal predecessors, (50864), 2564 states have call successors, (2564), 1164 states have call predecessors, (2564), 1356 states have return successors, (5609), 2626 states have call predecessors, (5609), 2564 states have call successors, (5609) [2024-10-11 03:14:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 59037 transitions. [2024-10-11 03:14:17,567 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 59037 transitions. Word has length 100 [2024-10-11 03:14:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:17,567 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 59037 transitions. [2024-10-11 03:14:17,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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-11 03:14:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 59037 transitions. [2024-10-11 03:14:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 03:14:17,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:17,637 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:17,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:14:17,638 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:17,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1318711564, now seen corresponding path program 1 times [2024-10-11 03:14:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:17,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994204872] [2024-10-11 03:14:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:17,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:14:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:14:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:14:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:14:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 03:14:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:14:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 03:14:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:14:17,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:17,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994204872] [2024-10-11 03:14:17,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994204872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:14:17,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335748466] [2024-10-11 03:14:17,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:17,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:14:17,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:14:17,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:14:17,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:14:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:17,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:14:17,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:14:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 03:14:18,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:14:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335748466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:18,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:14:18,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 03:14:18,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426678466] [2024-10-11 03:14:18,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:18,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:14:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:14:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:18,013 INFO L87 Difference]: Start difference. First operand 36885 states and 59037 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:14:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:22,651 INFO L93 Difference]: Finished difference Result 110044 states and 177361 transitions. [2024-10-11 03:14:22,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:14:22,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 162 [2024-10-11 03:14:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:22,883 INFO L225 Difference]: With dead ends: 110044 [2024-10-11 03:14:22,884 INFO L226 Difference]: Without dead ends: 73172 [2024-10-11 03:14:22,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:22,963 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 274 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:22,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 568 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:14:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73172 states. [2024-10-11 03:14:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73172 to 72976. [2024-10-11 03:14:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72976 states, 65237 states have (on average 1.5397550469825405) internal successors, (100449), 65752 states have internal predecessors, (100449), 5026 states have call successors, (5026), 2328 states have call predecessors, (5026), 2712 states have return successors, (10989), 5023 states have call predecessors, (10989), 5026 states have call successors, (10989) [2024-10-11 03:14:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72976 states to 72976 states and 116464 transitions. [2024-10-11 03:14:27,943 INFO L78 Accepts]: Start accepts. Automaton has 72976 states and 116464 transitions. Word has length 162 [2024-10-11 03:14:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:27,943 INFO L471 AbstractCegarLoop]: Abstraction has 72976 states and 116464 transitions. [2024-10-11 03:14:27,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:14:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 72976 states and 116464 transitions. [2024-10-11 03:14:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 03:14:28,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:28,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:28,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:14:28,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 03:14:28,233 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash -352874604, now seen corresponding path program 1 times [2024-10-11 03:14:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383810613] [2024-10-11 03:14:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:14:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:14:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:14:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 03:14:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 03:14:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:14:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 03:14:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:14:28,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:28,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383810613] [2024-10-11 03:14:28,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383810613] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:14:28,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227028221] [2024-10-11 03:14:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:28,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:14:28,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:14:28,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:14:28,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:14:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:28,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:14:28,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:14:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 03:14:28,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:14:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227028221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:28,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:14:28,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 03:14:28,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461765981] [2024-10-11 03:14:28,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:28,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:14:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:28,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:14:28,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:28,529 INFO L87 Difference]: Start difference. First operand 72976 states and 116464 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)