./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.11.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.11.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 c5f603027c62ff37561a520351662dbe2fd253b52e04e36028cb9a624978ef8e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:14:27,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:14:27,373 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:14:27,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:14:27,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:14:27,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:14:27,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:14:27,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:14:27,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:14:27,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:14:27,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:14:27,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:14:27,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:14:27,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:14:27,430 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:14:27,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:14:27,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:14:27,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:14:27,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:14:27,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:14:27,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:14:27,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:14:27,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:14:27,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:14:27,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:14:27,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:14:27,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:14:27,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:14:27,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:14:27,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:14:27,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:14:27,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:14:27,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:14:27,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:14:27,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:14:27,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:14:27,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:14:27,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:14:27,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:14:27,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:14:27,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:14:27,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:14:27,446 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 -> c5f603027c62ff37561a520351662dbe2fd253b52e04e36028cb9a624978ef8e [2024-10-11 03:14:27,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:14:27,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:14:27,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:14:27,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:14:27,815 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:14:27,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.11.cil-2.c [2024-10-11 03:14:29,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:14:29,503 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:14:29,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.11.cil-2.c [2024-10-11 03:14:29,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/02476c2db/1ef5a4e01f834f9fb0fa8febc2fca5ed/FLAG94092f7d4 [2024-10-11 03:14:29,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/02476c2db/1ef5a4e01f834f9fb0fa8febc2fca5ed [2024-10-11 03:14:29,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:14:29,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:14:29,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:14:29,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:14:29,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:14:29,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:14:29" (1/1) ... [2024-10-11 03:14:29,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8c8e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:29, skipping insertion in model container [2024-10-11 03:14:29,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:14:29" (1/1) ... [2024-10-11 03:14:29,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:14:29,766 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.11.cil-2.c[671,684] [2024-10-11 03:14:29,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:14:29,952 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:14:29,960 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.11.cil-2.c[671,684] [2024-10-11 03:14:29,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:14:30,016 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:14:30,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30 WrapperNode [2024-10-11 03:14:30,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:14:30,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:14:30,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:14:30,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:14:30,023 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:14:30" (1/1) ... [2024-10-11 03:14:30,035 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:14:30" (1/1) ... [2024-10-11 03:14:30,069 INFO L138 Inliner]: procedures = 50, calls = 64, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 819 [2024-10-11 03:14:30,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:14:30,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:14:30,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:14:30,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:14:30,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,106 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:14:30,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:14:30,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:14:30,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:14:30,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:14:30,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (1/1) ... [2024-10-11 03:14:30,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:14:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:14:30,164 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:14:30,168 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:14:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:14:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:14:30,203 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:14:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 03:14:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 03:14:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:14:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:14:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:14:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:14:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:14:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:14:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:14:30,205 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:14:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:14:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:14:30,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:14:30,286 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:14:30,288 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:14:31,041 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-11 03:14:31,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:14:31,127 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:14:31,129 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-11 03:14:31,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:14:31 BoogieIcfgContainer [2024-10-11 03:14:31,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:14:31,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:14:31,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:14:31,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:14:31,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:14:29" (1/3) ... [2024-10-11 03:14:31,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be939e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:14:31, skipping insertion in model container [2024-10-11 03:14:31,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:30" (2/3) ... [2024-10-11 03:14:31,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be939e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:14:31, skipping insertion in model container [2024-10-11 03:14:31,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:14:31" (3/3) ... [2024-10-11 03:14:31,138 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.11.cil-2.c [2024-10-11 03:14:31,155 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:14:31,155 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:14:31,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:14:31,252 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;@5c289398, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:14:31,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:14:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 325 states, 292 states have (on average 1.7328767123287672) internal successors, (506), 294 states have internal predecessors, (506), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 03:14:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:31,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:31,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:31,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1024203250, now seen corresponding path program 1 times [2024-10-11 03:14:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:31,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642349067] [2024-10-11 03:14:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:31,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:32,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:32,072 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:32,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:32,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642349067] [2024-10-11 03:14:32,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642349067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:14:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180201830] [2024-10-11 03:14:32,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:32,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:14:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:32,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:14:32,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:14:32,112 INFO L87 Difference]: Start difference. First operand has 325 states, 292 states have (on average 1.7328767123287672) internal successors, (506), 294 states have internal predecessors, (506), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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:14:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:34,176 INFO L93 Difference]: Finished difference Result 764 states and 1317 transitions. [2024-10-11 03:14:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:14:34,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:34,196 INFO L225 Difference]: With dead ends: 764 [2024-10-11 03:14:34,198 INFO L226 Difference]: Without dead ends: 443 [2024-10-11 03:14:34,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:14:34,210 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 906 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:34,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 584 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:14:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-11 03:14:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 323. [2024-10-11 03:14:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 291 states have (on average 1.6288659793814433) internal successors, (474), 292 states have internal predecessors, (474), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 03:14:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 524 transitions. [2024-10-11 03:14:34,328 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 524 transitions. Word has length 150 [2024-10-11 03:14:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:34,329 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 524 transitions. [2024-10-11 03:14:34,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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:14:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 524 transitions. [2024-10-11 03:14:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:34,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:34,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:34,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:14:34,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:34,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:34,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1450757748, now seen corresponding path program 1 times [2024-10-11 03:14:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:34,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739472151] [2024-10-11 03:14:34,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:34,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:34,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:34,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:34,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:34,621 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:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739472151] [2024-10-11 03:14:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739472151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:34,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:34,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:14:34,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932152377] [2024-10-11 03:14:34,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:34,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:14:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:34,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:14:34,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:14:34,627 INFO L87 Difference]: Start difference. First operand 323 states and 524 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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:14:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:36,180 INFO L93 Difference]: Finished difference Result 752 states and 1238 transitions. [2024-10-11 03:14:36,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:14:36,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:36,184 INFO L225 Difference]: With dead ends: 752 [2024-10-11 03:14:36,184 INFO L226 Difference]: Without dead ends: 443 [2024-10-11 03:14:36,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:14:36,187 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 895 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:36,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 579 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:14:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-11 03:14:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 323. [2024-10-11 03:14:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 291 states have (on average 1.6254295532646048) internal successors, (473), 292 states have internal predecessors, (473), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 03:14:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 523 transitions. [2024-10-11 03:14:36,208 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 523 transitions. Word has length 150 [2024-10-11 03:14:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:36,208 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 523 transitions. [2024-10-11 03:14:36,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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:14:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 523 transitions. [2024-10-11 03:14:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:36,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:36,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:36,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:14:36,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:36,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:36,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1445255946, now seen corresponding path program 1 times [2024-10-11 03:14:36,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:36,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502116916] [2024-10-11 03:14:36,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:36,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:36,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:36,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:36,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:36,477 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:36,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:36,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502116916] [2024-10-11 03:14:36,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502116916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:36,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:36,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:14:36,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245722308] [2024-10-11 03:14:36,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:36,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:14:36,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:36,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:14:36,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:14:36,479 INFO L87 Difference]: Start difference. First operand 323 states and 523 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 4 states have internal predecessors, (140), 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:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:39,366 INFO L93 Difference]: Finished difference Result 1192 states and 1975 transitions. [2024-10-11 03:14:39,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:14:39,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 4 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:39,374 INFO L225 Difference]: With dead ends: 1192 [2024-10-11 03:14:39,374 INFO L226 Difference]: Without dead ends: 886 [2024-10-11 03:14:39,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:39,377 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1367 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:39,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1120 Invalid, 2274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 03:14:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-11 03:14:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 647. [2024-10-11 03:14:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 588 states have (on average 1.6360544217687074) internal successors, (962), 590 states have internal predecessors, (962), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-11 03:14:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1055 transitions. [2024-10-11 03:14:39,456 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1055 transitions. Word has length 150 [2024-10-11 03:14:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:39,456 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 1055 transitions. [2024-10-11 03:14:39,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 4 states have internal predecessors, (140), 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:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1055 transitions. [2024-10-11 03:14:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:39,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:39,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:39,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:14:39,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:39,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1324030094, now seen corresponding path program 1 times [2024-10-11 03:14:39,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:39,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620228253] [2024-10-11 03:14:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:39,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:39,842 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:39,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:39,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620228253] [2024-10-11 03:14:39,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620228253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:39,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:39,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:39,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202614840] [2024-10-11 03:14:39,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:39,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:39,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:39,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:39,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:39,845 INFO L87 Difference]: Start difference. First operand 647 states and 1055 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:43,384 INFO L93 Difference]: Finished difference Result 1977 states and 3277 transitions. [2024-10-11 03:14:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:43,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:43,391 INFO L225 Difference]: With dead ends: 1977 [2024-10-11 03:14:43,391 INFO L226 Difference]: Without dead ends: 1347 [2024-10-11 03:14:43,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:43,395 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 1398 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 3514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:43,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 1857 Invalid, 3514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 03:14:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-10-11 03:14:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 946. [2024-10-11 03:14:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 860 states have (on average 1.6290697674418604) internal successors, (1401), 863 states have internal predecessors, (1401), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-11 03:14:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1536 transitions. [2024-10-11 03:14:43,459 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1536 transitions. Word has length 150 [2024-10-11 03:14:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:43,459 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1536 transitions. [2024-10-11 03:14:43,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1536 transitions. [2024-10-11 03:14:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:43,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:43,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:43,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:14:43,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:43,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:43,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1999190220, now seen corresponding path program 1 times [2024-10-11 03:14:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187546073] [2024-10-11 03:14:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,695 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:43,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:43,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187546073] [2024-10-11 03:14:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187546073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:43,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892570883] [2024-10-11 03:14:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:43,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:43,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:43,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:43,698 INFO L87 Difference]: Start difference. First operand 946 states and 1536 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:47,027 INFO L93 Difference]: Finished difference Result 3127 states and 5172 transitions. [2024-10-11 03:14:47,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:47,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:47,052 INFO L225 Difference]: With dead ends: 3127 [2024-10-11 03:14:47,052 INFO L226 Difference]: Without dead ends: 2198 [2024-10-11 03:14:47,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:47,059 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1396 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3451 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:47,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 1855 Invalid, 3512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3451 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 03:14:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2024-10-11 03:14:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1545. [2024-10-11 03:14:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.6227758007117439) internal successors, (2280), 1410 states have internal predecessors, (2280), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 03:14:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2503 transitions. [2024-10-11 03:14:47,277 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2503 transitions. Word has length 150 [2024-10-11 03:14:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:47,278 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2503 transitions. [2024-10-11 03:14:47,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2503 transitions. [2024-10-11 03:14:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:47,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:47,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:47,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:14:47,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:47,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1051138254, now seen corresponding path program 1 times [2024-10-11 03:14:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:47,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874686551] [2024-10-11 03:14:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:47,522 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:47,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:47,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874686551] [2024-10-11 03:14:47,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874686551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:47,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:47,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:47,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53649061] [2024-10-11 03:14:47,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:47,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:47,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:47,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:47,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:47,525 INFO L87 Difference]: Start difference. First operand 1545 states and 2503 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:49,080 INFO L93 Difference]: Finished difference Result 3716 states and 6132 transitions. [2024-10-11 03:14:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:49,088 INFO L225 Difference]: With dead ends: 3716 [2024-10-11 03:14:49,088 INFO L226 Difference]: Without dead ends: 2188 [2024-10-11 03:14:49,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:49,092 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 999 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:49,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 953 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:14:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2024-10-11 03:14:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 1545. [2024-10-11 03:14:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.6192170818505338) internal successors, (2275), 1410 states have internal predecessors, (2275), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 03:14:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2498 transitions. [2024-10-11 03:14:49,159 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2498 transitions. Word has length 150 [2024-10-11 03:14:49,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:49,159 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2498 transitions. [2024-10-11 03:14:49,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2498 transitions. [2024-10-11 03:14:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:49,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:49,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:49,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:14:49,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:49,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash 466366604, now seen corresponding path program 1 times [2024-10-11 03:14:49,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:49,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308862204] [2024-10-11 03:14:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:49,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:49,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:49,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:49,469 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:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:49,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308862204] [2024-10-11 03:14:49,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308862204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:49,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:49,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:49,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102141802] [2024-10-11 03:14:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:49,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:49,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:49,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:49,474 INFO L87 Difference]: Start difference. First operand 1545 states and 2498 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:51,050 INFO L93 Difference]: Finished difference Result 3710 states and 6106 transitions. [2024-10-11 03:14:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:51,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:51,060 INFO L225 Difference]: With dead ends: 3710 [2024-10-11 03:14:51,063 INFO L226 Difference]: Without dead ends: 2182 [2024-10-11 03:14:51,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:51,068 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 997 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:51,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 953 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:14:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2024-10-11 03:14:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 1545. [2024-10-11 03:14:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.6156583629893237) internal successors, (2270), 1410 states have internal predecessors, (2270), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 03:14:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2493 transitions. [2024-10-11 03:14:51,153 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2493 transitions. Word has length 150 [2024-10-11 03:14:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:51,155 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2493 transitions. [2024-10-11 03:14:51,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2493 transitions. [2024-10-11 03:14:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:51,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:51,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:51,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:14:51,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:51,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash 31861006, now seen corresponding path program 1 times [2024-10-11 03:14:51,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:51,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421946437] [2024-10-11 03:14:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,374 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:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421946437] [2024-10-11 03:14:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421946437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772416271] [2024-10-11 03:14:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:51,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:51,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:51,377 INFO L87 Difference]: Start difference. First operand 1545 states and 2493 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:53,506 INFO L93 Difference]: Finished difference Result 3703 states and 6078 transitions. [2024-10-11 03:14:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:53,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:53,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:53,521 INFO L225 Difference]: With dead ends: 3703 [2024-10-11 03:14:53,522 INFO L226 Difference]: Without dead ends: 2175 [2024-10-11 03:14:53,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:53,528 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1000 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:53,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 953 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:14:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2024-10-11 03:14:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 1545. [2024-10-11 03:14:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.612099644128114) internal successors, (2265), 1410 states have internal predecessors, (2265), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 03:14:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2488 transitions. [2024-10-11 03:14:53,640 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2488 transitions. Word has length 150 [2024-10-11 03:14:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:53,640 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2488 transitions. [2024-10-11 03:14:53,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2488 transitions. [2024-10-11 03:14:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:53,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:53,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:53,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:14:53,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:53,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash -397797300, now seen corresponding path program 1 times [2024-10-11 03:14:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:53,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641479713] [2024-10-11 03:14:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:53,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:53,879 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:53,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641479713] [2024-10-11 03:14:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641479713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:53,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:53,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:53,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131542691] [2024-10-11 03:14:53,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:53,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:53,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:53,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:53,882 INFO L87 Difference]: Start difference. First operand 1545 states and 2488 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:55,509 INFO L93 Difference]: Finished difference Result 3691 states and 6040 transitions. [2024-10-11 03:14:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:55,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:55,518 INFO L225 Difference]: With dead ends: 3691 [2024-10-11 03:14:55,518 INFO L226 Difference]: Without dead ends: 2163 [2024-10-11 03:14:55,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:55,523 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1138 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:55,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 802 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:14:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2024-10-11 03:14:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1545. [2024-10-11 03:14:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.6085409252669038) internal successors, (2260), 1410 states have internal predecessors, (2260), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 03:14:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2483 transitions. [2024-10-11 03:14:55,597 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2483 transitions. Word has length 150 [2024-10-11 03:14:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:55,598 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2483 transitions. [2024-10-11 03:14:55,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2483 transitions. [2024-10-11 03:14:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:55,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:55,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:55,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:14:55,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:55,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:55,601 INFO L85 PathProgramCache]: Analyzing trace with hash 549240586, now seen corresponding path program 1 times [2024-10-11 03:14:55,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:55,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585549819] [2024-10-11 03:14:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:55,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:55,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:55,887 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:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:55,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585549819] [2024-10-11 03:14:55,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585549819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:55,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:55,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:55,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902494023] [2024-10-11 03:14:55,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:55,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:55,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:55,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:55,890 INFO L87 Difference]: Start difference. First operand 1545 states and 2483 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:58,992 INFO L93 Difference]: Finished difference Result 5297 states and 8629 transitions. [2024-10-11 03:14:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:14:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:59,007 INFO L225 Difference]: With dead ends: 5297 [2024-10-11 03:14:59,007 INFO L226 Difference]: Without dead ends: 3769 [2024-10-11 03:14:59,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:59,012 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1367 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:59,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1855 Invalid, 3382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 03:14:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2024-10-11 03:14:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 2766. [2024-10-11 03:14:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2518 states have (on average 1.601667990468626) internal successors, (4033), 2527 states have internal predecessors, (4033), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-11 03:14:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4438 transitions. [2024-10-11 03:14:59,181 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4438 transitions. Word has length 150 [2024-10-11 03:14:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:59,181 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4438 transitions. [2024-10-11 03:14:59,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4438 transitions. [2024-10-11 03:14:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:14:59,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:59,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:59,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:14:59,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:59,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1411074188, now seen corresponding path program 1 times [2024-10-11 03:14:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:59,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574008256] [2024-10-11 03:14:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:59,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:59,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:14:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:59,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:14:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:59,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:14:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:14:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:59,397 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:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:59,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574008256] [2024-10-11 03:14:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574008256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861817043] [2024-10-11 03:14:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:59,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:59,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:59,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:59,399 INFO L87 Difference]: Start difference. First operand 2766 states and 4438 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:02,830 INFO L93 Difference]: Finished difference Result 9702 states and 15780 transitions. [2024-10-11 03:15:02,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:15:02,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:15:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:02,853 INFO L225 Difference]: With dead ends: 9702 [2024-10-11 03:15:02,853 INFO L226 Difference]: Without dead ends: 6953 [2024-10-11 03:15:02,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:15:02,860 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1366 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3308 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:02,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 1855 Invalid, 3369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3308 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 03:15:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6953 states. [2024-10-11 03:15:03,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6953 to 5205. [2024-10-11 03:15:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5205 states, 4741 states have (on average 1.5964986289812275) internal successors, (7569), 4758 states have internal predecessors, (7569), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-11 03:15:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 8356 transitions. [2024-10-11 03:15:03,110 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 8356 transitions. Word has length 150 [2024-10-11 03:15:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:03,111 INFO L471 AbstractCegarLoop]: Abstraction has 5205 states and 8356 transitions. [2024-10-11 03:15:03,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 8356 transitions. [2024-10-11 03:15:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:15:03,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:03,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:03,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:15:03,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:03,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:03,115 INFO L85 PathProgramCache]: Analyzing trace with hash -639334710, now seen corresponding path program 1 times [2024-10-11 03:15:03,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:03,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573821274] [2024-10-11 03:15:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:03,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:15:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:15:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:03,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:15:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:15:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:03,328 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:15:03,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573821274] [2024-10-11 03:15:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573821274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:03,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:03,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920303021] [2024-10-11 03:15:03,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:03,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:03,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:03,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:03,330 INFO L87 Difference]: Start difference. First operand 5205 states and 8356 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:06,619 INFO L93 Difference]: Finished difference Result 18503 states and 30124 transitions. [2024-10-11 03:15:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:15:06,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:15:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:06,666 INFO L225 Difference]: With dead ends: 18503 [2024-10-11 03:15:06,667 INFO L226 Difference]: Without dead ends: 13315 [2024-10-11 03:15:06,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:15:06,682 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1365 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3295 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:06,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 1855 Invalid, 3356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3295 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 03:15:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13315 states. [2024-10-11 03:15:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13315 to 10098. [2024-10-11 03:15:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10098 states, 9202 states have (on average 1.5934579439252337) internal successors, (14663), 9235 states have internal predecessors, (14663), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 03:15:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 16268 transitions. [2024-10-11 03:15:07,434 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 16268 transitions. Word has length 150 [2024-10-11 03:15:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:07,435 INFO L471 AbstractCegarLoop]: Abstraction has 10098 states and 16268 transitions. [2024-10-11 03:15:07,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 16268 transitions. [2024-10-11 03:15:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:15:07,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:07,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:07,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:15:07,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash -151287604, now seen corresponding path program 1 times [2024-10-11 03:15:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:07,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668419594] [2024-10-11 03:15:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:15:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:15:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:15:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:15:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,685 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:15:07,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:07,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668419594] [2024-10-11 03:15:07,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668419594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:07,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:07,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:07,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287980102] [2024-10-11 03:15:07,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:07,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:07,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:07,687 INFO L87 Difference]: Start difference. First operand 10098 states and 16268 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:09,807 INFO L93 Difference]: Finished difference Result 23561 states and 38573 transitions. [2024-10-11 03:15:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:09,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:15:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:09,853 INFO L225 Difference]: With dead ends: 23561 [2024-10-11 03:15:09,854 INFO L226 Difference]: Without dead ends: 13480 [2024-10-11 03:15:09,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:09,883 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 998 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:09,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 953 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:15:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13480 states. [2024-10-11 03:15:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13480 to 10098. [2024-10-11 03:15:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10098 states, 9202 states have (on average 1.5898717670071723) internal successors, (14630), 9235 states have internal predecessors, (14630), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 03:15:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 16235 transitions. [2024-10-11 03:15:10,730 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 16235 transitions. Word has length 150 [2024-10-11 03:15:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:10,731 INFO L471 AbstractCegarLoop]: Abstraction has 10098 states and 16235 transitions. [2024-10-11 03:15:10,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 16235 transitions. [2024-10-11 03:15:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:15:10,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:10,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:10,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:15:10,742 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:10,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1243922806, now seen corresponding path program 1 times [2024-10-11 03:15:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487594755] [2024-10-11 03:15:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:10,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:10,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:15:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:15:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:15:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:11,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:15:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:11,050 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:15:11,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487594755] [2024-10-11 03:15:11,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487594755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:11,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:11,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060839500] [2024-10-11 03:15:11,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:11,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:11,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:11,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:11,053 INFO L87 Difference]: Start difference. First operand 10098 states and 16235 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:16,278 INFO L93 Difference]: Finished difference Result 40552 states and 66040 transitions. [2024-10-11 03:15:16,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:15:16,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:15:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:16,371 INFO L225 Difference]: With dead ends: 40552 [2024-10-11 03:15:16,372 INFO L226 Difference]: Without dead ends: 30471 [2024-10-11 03:15:16,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:15:16,396 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1756 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:16,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 1848 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3247 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 03:15:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30471 states. [2024-10-11 03:15:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30471 to 19884. [2024-10-11 03:15:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19884 states, 18156 states have (on average 1.5881251376955277) internal successors, (28834), 18221 states have internal predecessors, (28834), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 454 states have return successors, (2066), 1336 states have call predecessors, (2066), 1273 states have call successors, (2066) [2024-10-11 03:15:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19884 states to 19884 states and 32173 transitions. [2024-10-11 03:15:17,696 INFO L78 Accepts]: Start accepts. Automaton has 19884 states and 32173 transitions. Word has length 150 [2024-10-11 03:15:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:17,696 INFO L471 AbstractCegarLoop]: Abstraction has 19884 states and 32173 transitions. [2024-10-11 03:15:17,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 19884 states and 32173 transitions. [2024-10-11 03:15:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:15:17,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:17,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:17,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:15:17,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:17,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1768872204, now seen corresponding path program 1 times [2024-10-11 03:15:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:17,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620155857] [2024-10-11 03:15:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:17,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:17,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:15:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:15:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:17,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:15:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:15:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:17,927 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:15:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620155857] [2024-10-11 03:15:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620155857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:17,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34814915] [2024-10-11 03:15:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:17,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:17,929 INFO L87 Difference]: Start difference. First operand 19884 states and 32173 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:24,999 INFO L93 Difference]: Finished difference Result 79344 states and 130040 transitions. [2024-10-11 03:15:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:15:25,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:15:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:25,173 INFO L225 Difference]: With dead ends: 79344 [2024-10-11 03:15:25,173 INFO L226 Difference]: Without dead ends: 59477 [2024-10-11 03:15:25,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:15:25,229 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1453 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 3849 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 3912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:25,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1844 Invalid, 3912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3849 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 03:15:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59477 states. [2024-10-11 03:15:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59477 to 39133. [2024-10-11 03:15:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39133 states, 35773 states have (on average 1.587454225253683) internal successors, (56788), 35902 states have internal predecessors, (56788), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 902 states have return successors, (4772), 2584 states have call predecessors, (4772), 2457 states have call successors, (4772) [2024-10-11 03:15:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39133 states to 39133 states and 64017 transitions. [2024-10-11 03:15:29,211 INFO L78 Accepts]: Start accepts. Automaton has 39133 states and 64017 transitions. Word has length 150 [2024-10-11 03:15:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:29,211 INFO L471 AbstractCegarLoop]: Abstraction has 39133 states and 64017 transitions. [2024-10-11 03:15:29,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 39133 states and 64017 transitions. [2024-10-11 03:15:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:15:29,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:29,231 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:29,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:15:29,231 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:29,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash -73603510, now seen corresponding path program 1 times [2024-10-11 03:15:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:29,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903838779] [2024-10-11 03:15:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:15:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:15:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:15:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:15:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:29,427 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:15:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903838779] [2024-10-11 03:15:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903838779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955468704] [2024-10-11 03:15:29,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:29,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:29,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:29,430 INFO L87 Difference]: Start difference. First operand 39133 states and 64017 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:40,785 INFO L93 Difference]: Finished difference Result 153405 states and 254218 transitions. [2024-10-11 03:15:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:15:40,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-11 03:15:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:41,335 INFO L225 Difference]: With dead ends: 153405 [2024-10-11 03:15:41,335 INFO L226 Difference]: Without dead ends: 114289 [2024-10-11 03:15:41,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:15:41,447 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1651 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3202 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:41,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 1848 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3202 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 03:15:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114289 states. [2024-10-11 03:15:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114289 to 78079. [2024-10-11 03:15:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78079 states, 71519 states have (on average 1.5882772410128776) internal successors, (113592), 71776 states have internal predecessors, (113592), 4761 states have call successors, (4761), 1542 states have call predecessors, (4761), 1798 states have return successors, (11578), 5016 states have call predecessors, (11578), 4761 states have call successors, (11578) [2024-10-11 03:15:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78079 states to 78079 states and 129931 transitions. [2024-10-11 03:15:48,163 INFO L78 Accepts]: Start accepts. Automaton has 78079 states and 129931 transitions. Word has length 150 [2024-10-11 03:15:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:48,164 INFO L471 AbstractCegarLoop]: Abstraction has 78079 states and 129931 transitions. [2024-10-11 03:15:48,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 78079 states and 129931 transitions. [2024-10-11 03:15:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:15:48,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:48,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:48,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:15:48,201 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:48,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash -406246648, now seen corresponding path program 1 times [2024-10-11 03:15:48,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:48,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669769483] [2024-10-11 03:15:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:15:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:15:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:15:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:15:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:48,361 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:15:48,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:48,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669769483] [2024-10-11 03:15:48,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669769483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:48,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:48,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:48,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973280824] [2024-10-11 03:15:48,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:48,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:48,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:48,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:48,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:48,364 INFO L87 Difference]: Start difference. First operand 78079 states and 129931 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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)