./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 306f27715421bb9e01ba3845cf0d248e2328487b897edb7780679dfca2048140 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:26:56,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:26:56,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:26:56,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:26:56,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:26:56,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:26:56,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:26:56,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:26:56,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:26:56,832 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:26:56,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:26:56,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:26:56,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:26:56,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:26:56,835 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:26:56,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:26:56,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:26:56,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:26:56,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:26:56,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:26:56,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:26:56,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:26:56,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:26:56,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:26:56,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:26:56,842 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:26:56,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:26:56,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:26:56,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:26:56,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:26:56,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:26:56,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:26:56,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:26:56,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:26:56,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:26:56,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:26:56,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:26:56,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:26:56,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:26:56,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:26:56,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:26:56,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:26:56,850 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 306f27715421bb9e01ba3845cf0d248e2328487b897edb7780679dfca2048140 [2024-10-14 04:26:57,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:26:57,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:26:57,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:26:57,166 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:26:57,167 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:26:57,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c [2024-10-14 04:26:58,619 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:26:59,193 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:26:59,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c [2024-10-14 04:26:59,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04e64935/6db4b3ff0f9d4f5b9c32e3c1887fdc0c/FLAGaa197f73d [2024-10-14 04:26:59,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04e64935/6db4b3ff0f9d4f5b9c32e3c1887fdc0c [2024-10-14 04:26:59,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:26:59,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:26:59,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:26:59,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:26:59,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:26:59,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:26:59" (1/1) ... [2024-10-14 04:26:59,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbfa85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:59, skipping insertion in model container [2024-10-14 04:26:59,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:26:59" (1/1) ... [2024-10-14 04:26:59,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:27:01,130 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/combinations/Problem05_label44+token_ring.06.cil-2.c[377340,377353] [2024-10-14 04:27:01,168 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/combinations/Problem05_label44+token_ring.06.cil-2.c[383339,383352] [2024-10-14 04:27:01,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:27:01,380 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:27:02,141 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/combinations/Problem05_label44+token_ring.06.cil-2.c[377340,377353] [2024-10-14 04:27:02,151 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/combinations/Problem05_label44+token_ring.06.cil-2.c[383339,383352] [2024-10-14 04:27:02,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:27:02,242 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:27:02,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02 WrapperNode [2024-10-14 04:27:02,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:27:02,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:27:02,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:27:02,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:27:02,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:02,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:02,776 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12873 [2024-10-14 04:27:02,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:27:02,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:27:02,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:27:02,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:27:02,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:02,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:02,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:02,922 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 04:27:02,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:02,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:03,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:03,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:03,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:03,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:03,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:27:03,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:27:03,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:27:03,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:27:03,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (1/1) ... [2024-10-14 04:27:03,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:27:03,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:27:03,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:27:03,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:27:03,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:27:03,377 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:27:03,377 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:27:03,378 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:27:03,378 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:27:03,378 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:27:03,379 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:27:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:27:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:27:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:27:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:27:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:27:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:27:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:27:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:27:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:27:03,516 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:27:03,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:27:11,087 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2024-10-14 04:27:11,088 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:27:11,202 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:27:11,203 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 04:27:11,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:27:11 BoogieIcfgContainer [2024-10-14 04:27:11,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:27:11,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:27:11,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:27:11,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:27:11,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:26:59" (1/3) ... [2024-10-14 04:27:11,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17617f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:27:11, skipping insertion in model container [2024-10-14 04:27:11,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:27:02" (2/3) ... [2024-10-14 04:27:11,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17617f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:27:11, skipping insertion in model container [2024-10-14 04:27:11,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:27:11" (3/3) ... [2024-10-14 04:27:11,215 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.06.cil-2.c [2024-10-14 04:27:11,232 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:27:11,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:27:11,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:27:11,387 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;@7685ffdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:27:11,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:27:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 2333 states, 2304 states have (on average 1.8815104166666667) internal successors, (4335), 2307 states have internal predecessors, (4335), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 04:27:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:11,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:11,417 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] [2024-10-14 04:27:11,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:11,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1188096418, now seen corresponding path program 1 times [2024-10-14 04:27:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364455045] [2024-10-14 04:27:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:11,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:11,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:11,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364455045] [2024-10-14 04:27:11,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364455045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:11,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:11,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:27:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104894284] [2024-10-14 04:27:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:11,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:27:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:11,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:27:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:27:11,993 INFO L87 Difference]: Start difference. First operand has 2333 states, 2304 states have (on average 1.8815104166666667) internal successors, (4335), 2307 states have internal predecessors, (4335), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:13,104 INFO L93 Difference]: Finished difference Result 4728 states and 8858 transitions. [2024-10-14 04:27:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:27:13,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:13,131 INFO L225 Difference]: With dead ends: 4728 [2024-10-14 04:27:13,132 INFO L226 Difference]: Without dead ends: 2399 [2024-10-14 04:27:13,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:27:13,148 INFO L432 NwaCegarLoop]: 4143 mSDtfsCounter, 553 mSDsluCounter, 12072 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 16215 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:13,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 16215 Invalid, 643 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 04:27:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-14 04:27:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2329. [2024-10-14 04:27:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2301 states have (on average 1.8457192524989134) internal successors, (4247), 2303 states have internal predecessors, (4247), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 04:27:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4287 transitions. [2024-10-14 04:27:13,324 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4287 transitions. Word has length 101 [2024-10-14 04:27:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:13,325 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4287 transitions. [2024-10-14 04:27:13,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4287 transitions. [2024-10-14 04:27:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:13,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:13,330 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] [2024-10-14 04:27:13,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:27:13,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:13,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:13,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1229807648, now seen corresponding path program 1 times [2024-10-14 04:27:13,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:13,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427863729] [2024-10-14 04:27:13,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:13,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:13,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:13,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:13,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427863729] [2024-10-14 04:27:13,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427863729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:13,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:13,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458923676] [2024-10-14 04:27:13,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:13,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:13,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:13,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:13,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:13,687 INFO L87 Difference]: Start difference. First operand 2329 states and 4287 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:16,345 INFO L93 Difference]: Finished difference Result 2881 states and 5198 transitions. [2024-10-14 04:27:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:27:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:16,366 INFO L225 Difference]: With dead ends: 2881 [2024-10-14 04:27:16,367 INFO L226 Difference]: Without dead ends: 2685 [2024-10-14 04:27:16,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:27:16,371 INFO L432 NwaCegarLoop]: 4241 mSDtfsCounter, 4743 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4756 SdHoareTripleChecker+Valid, 20974 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:16,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4756 Valid, 20974 Invalid, 2226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 04:27:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2024-10-14 04:27:16,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2536. [2024-10-14 04:27:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2483 states have (on average 1.829238824003222) internal successors, (4542), 2487 states have internal predecessors, (4542), 37 states have call successors, (37), 12 states have call predecessors, (37), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2024-10-14 04:27:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4623 transitions. [2024-10-14 04:27:16,494 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4623 transitions. Word has length 101 [2024-10-14 04:27:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:16,494 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 4623 transitions. [2024-10-14 04:27:16,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4623 transitions. [2024-10-14 04:27:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:16,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:16,505 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] [2024-10-14 04:27:16,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:27:16,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:16,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1188676830, now seen corresponding path program 1 times [2024-10-14 04:27:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:16,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628692436] [2024-10-14 04:27:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:16,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:16,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:16,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:16,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:16,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628692436] [2024-10-14 04:27:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628692436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:16,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:16,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:16,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64123576] [2024-10-14 04:27:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:16,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:16,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:16,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:16,823 INFO L87 Difference]: Start difference. First operand 2536 states and 4623 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:18,939 INFO L93 Difference]: Finished difference Result 3580 states and 6330 transitions. [2024-10-14 04:27:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:27:18,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:18,957 INFO L225 Difference]: With dead ends: 3580 [2024-10-14 04:27:18,957 INFO L226 Difference]: Without dead ends: 3179 [2024-10-14 04:27:18,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:27:18,962 INFO L432 NwaCegarLoop]: 4202 mSDtfsCounter, 4768 mSDsluCounter, 16681 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4781 SdHoareTripleChecker+Valid, 20883 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:18,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4781 Valid, 20883 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 04:27:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-10-14 04:27:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2914. [2024-10-14 04:27:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.8008519701810437) internal successors, (5073), 2823 states have internal predecessors, (5073), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-14 04:27:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5224 transitions. [2024-10-14 04:27:19,079 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5224 transitions. Word has length 101 [2024-10-14 04:27:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:19,081 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5224 transitions. [2024-10-14 04:27:19,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5224 transitions. [2024-10-14 04:27:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:19,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:19,087 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] [2024-10-14 04:27:19,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:27:19,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1227159520, now seen corresponding path program 1 times [2024-10-14 04:27:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958590867] [2024-10-14 04:27:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:19,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:19,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:19,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:19,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:19,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:19,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958590867] [2024-10-14 04:27:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958590867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:19,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:19,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228885710] [2024-10-14 04:27:19,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:19,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:19,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:19,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:19,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:19,333 INFO L87 Difference]: Start difference. First operand 2914 states and 5224 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:20,218 INFO L93 Difference]: Finished difference Result 3965 states and 6956 transitions. [2024-10-14 04:27:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:27:20,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:20,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:20,237 INFO L225 Difference]: With dead ends: 3965 [2024-10-14 04:27:20,237 INFO L226 Difference]: Without dead ends: 3184 [2024-10-14 04:27:20,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:27:20,243 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4644 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4658 SdHoareTripleChecker+Valid, 16333 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:20,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4658 Valid, 16333 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 04:27:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2024-10-14 04:27:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2914. [2024-10-14 04:27:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.7990770323038694) internal successors, (5068), 2823 states have internal predecessors, (5068), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-14 04:27:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5219 transitions. [2024-10-14 04:27:20,362 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5219 transitions. Word has length 101 [2024-10-14 04:27:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:20,362 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5219 transitions. [2024-10-14 04:27:20,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5219 transitions. [2024-10-14 04:27:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:20,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:20,365 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] [2024-10-14 04:27:20,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:27:20,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:20,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1742951582, now seen corresponding path program 1 times [2024-10-14 04:27:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766125184] [2024-10-14 04:27:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:20,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:20,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:20,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:20,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766125184] [2024-10-14 04:27:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766125184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:20,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097109206] [2024-10-14 04:27:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:20,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:20,572 INFO L87 Difference]: Start difference. First operand 2914 states and 5219 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:21,617 INFO L93 Difference]: Finished difference Result 3961 states and 6935 transitions. [2024-10-14 04:27:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:27:21,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:21,631 INFO L225 Difference]: With dead ends: 3961 [2024-10-14 04:27:21,631 INFO L226 Difference]: Without dead ends: 3180 [2024-10-14 04:27:21,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:27:21,636 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4642 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4656 SdHoareTripleChecker+Valid, 16333 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:21,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4656 Valid, 16333 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 04:27:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2024-10-14 04:27:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2914. [2024-10-14 04:27:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.797302094426695) internal successors, (5063), 2823 states have internal predecessors, (5063), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-14 04:27:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5214 transitions. [2024-10-14 04:27:21,742 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5214 transitions. Word has length 101 [2024-10-14 04:27:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:21,743 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5214 transitions. [2024-10-14 04:27:21,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5214 transitions. [2024-10-14 04:27:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:21,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:21,745 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] [2024-10-14 04:27:21,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:27:21,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:21,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:21,747 INFO L85 PathProgramCache]: Analyzing trace with hash -176193632, now seen corresponding path program 1 times [2024-10-14 04:27:21,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:21,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683908301] [2024-10-14 04:27:21,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:21,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:21,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:21,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:21,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:21,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:21,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-14 04:27:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683908301] [2024-10-14 04:27:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683908301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:21,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:21,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:21,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407580558] [2024-10-14 04:27:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:21,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:21,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:21,930 INFO L87 Difference]: Start difference. First operand 2914 states and 5214 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:22,877 INFO L93 Difference]: Finished difference Result 3956 states and 6912 transitions. [2024-10-14 04:27:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:27:22,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:22,889 INFO L225 Difference]: With dead ends: 3956 [2024-10-14 04:27:22,890 INFO L226 Difference]: Without dead ends: 3175 [2024-10-14 04:27:22,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:27:22,895 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4555 mSDsluCounter, 16280 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 20387 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:22,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 20387 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 04:27:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2024-10-14 04:27:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2914. [2024-10-14 04:27:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.7955271565495208) internal successors, (5058), 2823 states have internal predecessors, (5058), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-14 04:27:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5209 transitions. [2024-10-14 04:27:22,999 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5209 transitions. Word has length 101 [2024-10-14 04:27:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:22,999 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5209 transitions. [2024-10-14 04:27:22,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5209 transitions. [2024-10-14 04:27:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:23,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:23,002 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] [2024-10-14 04:27:23,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:27:23,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:23,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1234031710, now seen corresponding path program 1 times [2024-10-14 04:27:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:23,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430360975] [2024-10-14 04:27:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:23,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:23,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:23,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:23,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430360975] [2024-10-14 04:27:23,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430360975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:23,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:23,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:23,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294360536] [2024-10-14 04:27:23,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:23,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:23,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:23,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:23,183 INFO L87 Difference]: Start difference. First operand 2914 states and 5209 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:25,160 INFO L93 Difference]: Finished difference Result 4927 states and 8441 transitions. [2024-10-14 04:27:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:27:25,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:25,181 INFO L225 Difference]: With dead ends: 4927 [2024-10-14 04:27:25,182 INFO L226 Difference]: Without dead ends: 4148 [2024-10-14 04:27:25,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:27:25,195 INFO L432 NwaCegarLoop]: 4240 mSDtfsCounter, 4734 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4747 SdHoareTripleChecker+Valid, 20973 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:25,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4747 Valid, 20973 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 04:27:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2024-10-14 04:27:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 3681. [2024-10-14 04:27:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3496 states have (on average 1.7502860411899313) internal successors, (6119), 3506 states have internal predecessors, (6119), 127 states have call successors, (127), 48 states have call predecessors, (127), 56 states have return successors, (170), 134 states have call predecessors, (170), 127 states have call successors, (170) [2024-10-14 04:27:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6416 transitions. [2024-10-14 04:27:25,350 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6416 transitions. Word has length 101 [2024-10-14 04:27:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:25,352 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 6416 transitions. [2024-10-14 04:27:25,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6416 transitions. [2024-10-14 04:27:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:25,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:25,356 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] [2024-10-14 04:27:25,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:27:25,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1918433120, now seen corresponding path program 1 times [2024-10-14 04:27:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336989360] [2024-10-14 04:27:25,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:25,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:25,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:25,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:25,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336989360] [2024-10-14 04:27:25,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336989360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:25,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895958287] [2024-10-14 04:27:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:25,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:25,541 INFO L87 Difference]: Start difference. First operand 3681 states and 6416 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:27,811 INFO L93 Difference]: Finished difference Result 8286 states and 13806 transitions. [2024-10-14 04:27:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:27:27,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:27,842 INFO L225 Difference]: With dead ends: 8286 [2024-10-14 04:27:27,842 INFO L226 Difference]: Without dead ends: 6740 [2024-10-14 04:27:27,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:27:27,853 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4964 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4984 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:27,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4984 Valid, 20963 Invalid, 2108 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 04:27:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2024-10-14 04:27:28,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 5206. [2024-10-14 04:27:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5206 states, 4853 states have (on average 1.6985369874304554) internal successors, (8243), 4871 states have internal predecessors, (8243), 239 states have call successors, (239), 96 states have call predecessors, (239), 112 states have return successors, (352), 254 states have call predecessors, (352), 239 states have call successors, (352) [2024-10-14 04:27:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 8834 transitions. [2024-10-14 04:27:28,206 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 8834 transitions. Word has length 101 [2024-10-14 04:27:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:28,206 INFO L471 AbstractCegarLoop]: Abstraction has 5206 states and 8834 transitions. [2024-10-14 04:27:28,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 8834 transitions. [2024-10-14 04:27:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:28,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:28,213 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] [2024-10-14 04:27:28,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:27:28,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:28,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2136294430, now seen corresponding path program 1 times [2024-10-14 04:27:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958777213] [2024-10-14 04:27:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:28,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:28,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:28,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:28,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:28,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958777213] [2024-10-14 04:27:28,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958777213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:28,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:28,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054281282] [2024-10-14 04:27:28,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:28,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:28,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:28,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:28,440 INFO L87 Difference]: Start difference. First operand 5206 states and 8834 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:30,649 INFO L93 Difference]: Finished difference Result 13949 states and 22916 transitions. [2024-10-14 04:27:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:27:30,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:30,684 INFO L225 Difference]: With dead ends: 13949 [2024-10-14 04:27:30,684 INFO L226 Difference]: Without dead ends: 10878 [2024-10-14 04:27:30,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:27:30,701 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 4907 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4927 SdHoareTripleChecker+Valid, 20965 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:30,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4927 Valid, 20965 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 04:27:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10878 states. [2024-10-14 04:27:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10878 to 8271. [2024-10-14 04:27:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8271 states, 7590 states have (on average 1.6517786561264822) internal successors, (12537), 7624 states have internal predecessors, (12537), 455 states have call successors, (455), 192 states have call predecessors, (455), 224 states have return successors, (762), 486 states have call predecessors, (762), 455 states have call successors, (762) [2024-10-14 04:27:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8271 states to 8271 states and 13754 transitions. [2024-10-14 04:27:31,111 INFO L78 Accepts]: Start accepts. Automaton has 8271 states and 13754 transitions. Word has length 101 [2024-10-14 04:27:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:31,112 INFO L471 AbstractCegarLoop]: Abstraction has 8271 states and 13754 transitions. [2024-10-14 04:27:31,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 8271 states and 13754 transitions. [2024-10-14 04:27:31,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:31,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:31,119 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] [2024-10-14 04:27:31,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:27:31,120 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:31,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2109228828, now seen corresponding path program 1 times [2024-10-14 04:27:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:31,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777399975] [2024-10-14 04:27:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:31,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:31,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:31,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:31,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:31,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777399975] [2024-10-14 04:27:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777399975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:31,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:31,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686420635] [2024-10-14 04:27:31,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:31,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:31,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:31,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:31,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:31,287 INFO L87 Difference]: Start difference. First operand 8271 states and 13754 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:33,709 INFO L93 Difference]: Finished difference Result 25224 states and 41230 transitions. [2024-10-14 04:27:33,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:27:33,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:33,789 INFO L225 Difference]: With dead ends: 25224 [2024-10-14 04:27:33,790 INFO L226 Difference]: Without dead ends: 19088 [2024-10-14 04:27:33,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:27:33,819 INFO L432 NwaCegarLoop]: 4204 mSDtfsCounter, 4884 mSDsluCounter, 16679 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 20883 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:33,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4904 Valid, 20883 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 04:27:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19088 states. [2024-10-14 04:27:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19088 to 14401. [2024-10-14 04:27:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14401 states, 13080 states have (on average 1.6175076452599388) internal successors, (21157), 13146 states have internal predecessors, (21157), 871 states have call successors, (871), 384 states have call predecessors, (871), 448 states have return successors, (1728), 934 states have call predecessors, (1728), 871 states have call successors, (1728) [2024-10-14 04:27:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14401 states to 14401 states and 23756 transitions. [2024-10-14 04:27:34,655 INFO L78 Accepts]: Start accepts. Automaton has 14401 states and 23756 transitions. Word has length 101 [2024-10-14 04:27:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:34,655 INFO L471 AbstractCegarLoop]: Abstraction has 14401 states and 23756 transitions. [2024-10-14 04:27:34,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 14401 states and 23756 transitions. [2024-10-14 04:27:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:34,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:34,668 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] [2024-10-14 04:27:34,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:27:34,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:34,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:34,669 INFO L85 PathProgramCache]: Analyzing trace with hash 108401570, now seen corresponding path program 1 times [2024-10-14 04:27:34,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:34,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400332839] [2024-10-14 04:27:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:34,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:35,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:35,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:35,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400332839] [2024-10-14 04:27:35,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400332839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:35,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:35,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379932200] [2024-10-14 04:27:35,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:35,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:35,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:35,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:35,035 INFO L87 Difference]: Start difference. First operand 14401 states and 23756 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:38,700 INFO L93 Difference]: Finished difference Result 47294 states and 77674 transitions. [2024-10-14 04:27:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:27:38,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:38,848 INFO L225 Difference]: With dead ends: 47294 [2024-10-14 04:27:38,848 INFO L226 Difference]: Without dead ends: 35028 [2024-10-14 04:27:38,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:27:38,899 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4775 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4787 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:38,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4787 Valid, 20963 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 04:27:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35028 states. [2024-10-14 04:27:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35028 to 26661. [2024-10-14 04:27:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26661 states, 24092 states have (on average 1.596422048812884) internal successors, (38461), 24222 states have internal predecessors, (38461), 1671 states have call successors, (1671), 768 states have call predecessors, (1671), 896 states have return successors, (4114), 1798 states have call predecessors, (4114), 1671 states have call successors, (4114) [2024-10-14 04:27:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26661 states to 26661 states and 44246 transitions. [2024-10-14 04:27:40,770 INFO L78 Accepts]: Start accepts. Automaton has 26661 states and 44246 transitions. Word has length 101 [2024-10-14 04:27:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:40,772 INFO L471 AbstractCegarLoop]: Abstraction has 26661 states and 44246 transitions. [2024-10-14 04:27:40,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 26661 states and 44246 transitions. [2024-10-14 04:27:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:40,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:40,793 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] [2024-10-14 04:27:40,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:27:40,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:40,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:40,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1842506020, now seen corresponding path program 1 times [2024-10-14 04:27:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:40,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706118654] [2024-10-14 04:27:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:40,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:40,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:40,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:41,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:41,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:41,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:41,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706118654] [2024-10-14 04:27:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706118654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:41,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:41,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936788358] [2024-10-14 04:27:41,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:41,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:41,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:41,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:41,047 INFO L87 Difference]: Start difference. First operand 26661 states and 44246 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:27:46,242 INFO L93 Difference]: Finished difference Result 90474 states and 150842 transitions. [2024-10-14 04:27:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:27:46,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:27:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:27:46,535 INFO L225 Difference]: With dead ends: 90474 [2024-10-14 04:27:46,535 INFO L226 Difference]: Without dead ends: 65948 [2024-10-14 04:27:46,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:27:46,608 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4805 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4825 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:27:46,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4825 Valid, 20963 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 04:27:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65948 states. [2024-10-14 04:27:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65948 to 51181. [2024-10-14 04:27:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51181 states, 46180 states have (on average 1.585036812472932) internal successors, (73197), 46438 states have internal predecessors, (73197), 3207 states have call successors, (3207), 1536 states have call predecessors, (3207), 1792 states have return successors, (10280), 3462 states have call predecessors, (10280), 3207 states have call successors, (10280) [2024-10-14 04:27:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51181 states to 51181 states and 86684 transitions. [2024-10-14 04:27:50,446 INFO L78 Accepts]: Start accepts. Automaton has 51181 states and 86684 transitions. Word has length 101 [2024-10-14 04:27:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:27:50,446 INFO L471 AbstractCegarLoop]: Abstraction has 51181 states and 86684 transitions. [2024-10-14 04:27:50,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:27:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 51181 states and 86684 transitions. [2024-10-14 04:27:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 04:27:50,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:27:50,492 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] [2024-10-14 04:27:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:27:50,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:27:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:27:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1565238430, now seen corresponding path program 1 times [2024-10-14 04:27:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:27:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730650626] [2024-10-14 04:27:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:27:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:27:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:50,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:27:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 04:27:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 04:27:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 04:27:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:27:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:27:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:27:50,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:27:50,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730650626] [2024-10-14 04:27:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730650626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:27:50,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:27:50,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:27:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413801821] [2024-10-14 04:27:50,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:27:50,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:27:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:27:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:27:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:27:50,658 INFO L87 Difference]: Start difference. First operand 51181 states and 86684 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:28:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:28:00,413 INFO L93 Difference]: Finished difference Result 174914 states and 299682 transitions. [2024-10-14 04:28:00,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:28:00,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-14 04:28:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:28:01,096 INFO L225 Difference]: With dead ends: 174914 [2024-10-14 04:28:01,096 INFO L226 Difference]: Without dead ends: 125868 [2024-10-14 04:28:01,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:28:01,322 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4756 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4768 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:28:01,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4768 Valid, 20963 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 04:28:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125868 states.