./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.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.12.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3cf66723094c16b3ec081bddaed276332b3b239b1c88ec16db8fa6791967fb2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:18:58,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:18:58,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:18:58,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:18:58,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:18:58,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:18:58,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:18:58,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:18:58,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:18:58,611 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:18:58,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:18:58,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:18:58,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:18:58,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:18:58,615 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:18:58,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:18:58,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:18:58,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:18:58,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:18:58,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:18:58,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:18:58,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:18:58,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:18:58,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:18:58,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:18:58,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:18:58,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:18:58,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:18:58,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:18:58,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:18:58,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:18:58,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:18:58,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:18:58,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:18:58,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:18:58,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:18:58,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:18:58,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:18:58,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:18:58,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:18:58,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:18:58,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:18:58,638 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3cf66723094c16b3ec081bddaed276332b3b239b1c88ec16db8fa6791967fb2 [2024-10-11 04:18:58,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:18:58,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:18:58,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:18:58,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:18:58,920 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:18:58,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.12.cil-2.c [2024-10-11 04:19:00,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:19:01,032 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:19:01,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.12.cil-2.c [2024-10-11 04:19:01,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eeea6434d/835fa11a6efc4fc8b9c6ada46040fbfb/FLAG85b1d6ed2 [2024-10-11 04:19:01,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eeea6434d/835fa11a6efc4fc8b9c6ada46040fbfb [2024-10-11 04:19:01,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:19:01,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:19:01,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:19:01,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:19:01,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:19:01,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:01" (1/1) ... [2024-10-11 04:19:01,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541e7e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:01, skipping insertion in model container [2024-10-11 04:19:01,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:01" (1/1) ... [2024-10-11 04:19:01,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:19:02,928 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.12.cil-2.c[377340,377353] [2024-10-11 04:19:02,958 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.12.cil-2.c[383339,383352] [2024-10-11 04:19:03,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:19:03,282 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:19:04,169 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.12.cil-2.c[377340,377353] [2024-10-11 04:19:04,178 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.12.cil-2.c[383339,383352] [2024-10-11 04:19:04,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:19:04,279 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:19:04,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04 WrapperNode [2024-10-11 04:19:04,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:19:04,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:19:04,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:19:04,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:19:04,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:04,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:04,830 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13233 [2024-10-11 04:19:04,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:19:04,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:19:04,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:19:04,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:19:04,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:04,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:04,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:05,091 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:19:05,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:05,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:05,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:05,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:05,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:05,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:05,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:19:05,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:19:05,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:19:05,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:19:05,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (1/1) ... [2024-10-11 04:19:05,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:19:05,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:19:05,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:19:05,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:19:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:19:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:19:05,545 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:19:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:19:05,547 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:19:05,547 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:19:05,547 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:19:05,547 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:19:05,547 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:19:05,547 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:19:05,547 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:19:05,547 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:19:05,547 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:19:05,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:19:05,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:19:05,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:19:05,684 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:19:05,687 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:19:13,956 INFO L? ?]: Removed 1755 outVars from TransFormulas that were not future-live. [2024-10-11 04:19:13,957 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:19:14,075 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:19:14,075 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-11 04:19:14,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:19:14 BoogieIcfgContainer [2024-10-11 04:19:14,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:19:14,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:19:14,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:19:14,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:19:14,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:19:01" (1/3) ... [2024-10-11 04:19:14,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae2786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:19:14, skipping insertion in model container [2024-10-11 04:19:14,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:04" (2/3) ... [2024-10-11 04:19:14,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae2786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:19:14, skipping insertion in model container [2024-10-11 04:19:14,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:19:14" (3/3) ... [2024-10-11 04:19:14,084 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.12.cil-2.c [2024-10-11 04:19:14,100 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:19:14,101 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:19:14,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:19:14,221 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;@6df98f66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:19:14,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:19:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 2471 states, 2436 states have (on average 1.875615763546798) internal successors, (4569), 2439 states have internal predecessors, (4569), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:19:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:14,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:14,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:14,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:14,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1395407095, now seen corresponding path program 1 times [2024-10-11 04:19:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:14,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198227317] [2024-10-11 04:19:14,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:14,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:14,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:14,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:14,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198227317] [2024-10-11 04:19:14,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198227317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:14,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:14,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:19:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448842616] [2024-10-11 04:19:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:14,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:19:14,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:15,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:19:15,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:19:15,020 INFO L87 Difference]: Start difference. First operand has 2471 states, 2436 states have (on average 1.875615763546798) internal successors, (4569), 2439 states have internal predecessors, (4569), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:17,355 INFO L93 Difference]: Finished difference Result 5068 states and 9466 transitions. [2024-10-11 04:19:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:19:17,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:17,393 INFO L225 Difference]: With dead ends: 5068 [2024-10-11 04:19:17,393 INFO L226 Difference]: Without dead ends: 2597 [2024-10-11 04:19:17,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:19:17,412 INFO L432 NwaCegarLoop]: 4257 mSDtfsCounter, 979 mSDsluCounter, 12204 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 16461 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:17,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 16461 Invalid, 1126 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:19:17,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-10-11 04:19:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2467. [2024-10-11 04:19:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2433 states have (on average 1.8368269625976161) internal successors, (4469), 2435 states have internal predecessors, (4469), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:19:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 4521 transitions. [2024-10-11 04:19:17,590 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 4521 transitions. Word has length 161 [2024-10-11 04:19:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:17,591 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 4521 transitions. [2024-10-11 04:19:17,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 4521 transitions. [2024-10-11 04:19:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:17,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:17,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:17,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:19:17,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:17,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2006676153, now seen corresponding path program 1 times [2024-10-11 04:19:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905531310] [2024-10-11 04:19:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:17,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:17,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:17,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905531310] [2024-10-11 04:19:17,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905531310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:17,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:17,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:19:17,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742539360] [2024-10-11 04:19:17,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:17,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:19:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:17,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:19:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:19:17,901 INFO L87 Difference]: Start difference. First operand 2467 states and 4521 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:19,995 INFO L93 Difference]: Finished difference Result 2930 states and 5294 transitions. [2024-10-11 04:19:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:19:19,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:20,011 INFO L225 Difference]: With dead ends: 2930 [2024-10-11 04:19:20,011 INFO L226 Difference]: Without dead ends: 2597 [2024-10-11 04:19:20,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:19:20,016 INFO L432 NwaCegarLoop]: 4253 mSDtfsCounter, 967 mSDsluCounter, 12195 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 16448 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:20,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 16448 Invalid, 1115 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:19:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-10-11 04:19:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2467. [2024-10-11 04:19:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2433 states have (on average 1.8364159473900534) internal successors, (4468), 2435 states have internal predecessors, (4468), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:19:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 4520 transitions. [2024-10-11 04:19:20,119 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 4520 transitions. Word has length 161 [2024-10-11 04:19:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:20,121 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 4520 transitions. [2024-10-11 04:19:20,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 4520 transitions. [2024-10-11 04:19:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:20,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:20,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:20,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:19:20,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:20,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash -965112197, now seen corresponding path program 1 times [2024-10-11 04:19:20,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:20,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464288302] [2024-10-11 04:19:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:20,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:20,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:20,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:20,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:20,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464288302] [2024-10-11 04:19:20,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464288302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:20,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:19:20,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125187197] [2024-10-11 04:19:20,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:20,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:19:20,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:20,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:19:20,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:19:20,651 INFO L87 Difference]: Start difference. First operand 2467 states and 4520 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:23,692 INFO L93 Difference]: Finished difference Result 3402 states and 6086 transitions. [2024-10-11 04:19:23,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:19:23,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:23,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:23,708 INFO L225 Difference]: With dead ends: 3402 [2024-10-11 04:19:23,709 INFO L226 Difference]: Without dead ends: 3074 [2024-10-11 04:19:23,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:23,713 INFO L432 NwaCegarLoop]: 4221 mSDtfsCounter, 5433 mSDsluCounter, 12655 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5452 SdHoareTripleChecker+Valid, 16876 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:23,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5452 Valid, 16876 Invalid, 2405 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [108 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:19:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2024-10-11 04:19:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 2815. [2024-10-11 04:19:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2753 states have (on average 1.8147475481293134) internal successors, (4996), 2756 states have internal predecessors, (4996), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-11 04:19:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 5093 transitions. [2024-10-11 04:19:23,952 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 5093 transitions. Word has length 161 [2024-10-11 04:19:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:23,953 INFO L471 AbstractCegarLoop]: Abstraction has 2815 states and 5093 transitions. [2024-10-11 04:19:23,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 5093 transitions. [2024-10-11 04:19:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:23,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:23,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:23,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:19:23,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:23,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1451895109, now seen corresponding path program 1 times [2024-10-11 04:19:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:23,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001418759] [2024-10-11 04:19:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:24,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:24,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001418759] [2024-10-11 04:19:24,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001418759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:24,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:24,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181441758] [2024-10-11 04:19:24,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:24,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:24,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:24,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:24,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:24,448 INFO L87 Difference]: Start difference. First operand 2815 states and 5093 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:28,648 INFO L93 Difference]: Finished difference Result 4247 states and 7492 transitions. [2024-10-11 04:19:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:28,668 INFO L225 Difference]: With dead ends: 4247 [2024-10-11 04:19:28,668 INFO L226 Difference]: Without dead ends: 3571 [2024-10-11 04:19:28,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:28,673 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5470 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5489 SdHoareTripleChecker+Valid, 21777 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:28,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5489 Valid, 21777 Invalid, 3786 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [61 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 04:19:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2024-10-11 04:19:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 3136. [2024-10-11 04:19:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3046 states have (on average 1.7957977675640184) internal successors, (5470), 3050 states have internal predecessors, (5470), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 04:19:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 5611 transitions. [2024-10-11 04:19:28,798 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 5611 transitions. Word has length 161 [2024-10-11 04:19:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:28,798 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 5611 transitions. [2024-10-11 04:19:28,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 5611 transitions. [2024-10-11 04:19:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:28,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:28,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:28,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:19:28,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1055202365, now seen corresponding path program 1 times [2024-10-11 04:19:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294368344] [2024-10-11 04:19:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:29,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294368344] [2024-10-11 04:19:29,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294368344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:29,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:29,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532842244] [2024-10-11 04:19:29,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:29,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:29,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:29,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:29,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:29,146 INFO L87 Difference]: Start difference. First operand 3136 states and 5611 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:32,571 INFO L93 Difference]: Finished difference Result 5485 states and 9538 transitions. [2024-10-11 04:19:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:32,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:32,592 INFO L225 Difference]: With dead ends: 5485 [2024-10-11 04:19:32,592 INFO L226 Difference]: Without dead ends: 4488 [2024-10-11 04:19:32,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:32,599 INFO L432 NwaCegarLoop]: 4230 mSDtfsCounter, 5580 mSDsluCounter, 16851 mSDsCounter, 0 mSdLazyCounter, 3091 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5599 SdHoareTripleChecker+Valid, 21081 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:32,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5599 Valid, 21081 Invalid, 3190 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [99 Valid, 3091 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 04:19:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4488 states. [2024-10-11 04:19:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4488 to 3779. [2024-10-11 04:19:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3633 states have (on average 1.766859344894027) internal successors, (6419), 3639 states have internal predecessors, (6419), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:19:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6652 transitions. [2024-10-11 04:19:32,753 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6652 transitions. Word has length 161 [2024-10-11 04:19:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:32,754 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6652 transitions. [2024-10-11 04:19:32,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6652 transitions. [2024-10-11 04:19:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:32,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:32,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:32,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:19:32,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:32,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1080680837, now seen corresponding path program 1 times [2024-10-11 04:19:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:32,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685321289] [2024-10-11 04:19:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:32,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:32,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:33,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:33,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685321289] [2024-10-11 04:19:33,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685321289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:33,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:33,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:33,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658693864] [2024-10-11 04:19:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:33,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:33,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:33,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:33,097 INFO L87 Difference]: Start difference. First operand 3779 states and 6652 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:34,925 INFO L93 Difference]: Finished difference Result 6118 states and 10572 transitions. [2024-10-11 04:19:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:34,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:34,947 INFO L225 Difference]: With dead ends: 6118 [2024-10-11 04:19:34,947 INFO L226 Difference]: Without dead ends: 4478 [2024-10-11 04:19:34,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:34,957 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5192 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5212 SdHoareTripleChecker+Valid, 16690 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:34,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5212 Valid, 16690 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:19:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2024-10-11 04:19:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 3779. [2024-10-11 04:19:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3633 states have (on average 1.7654830718414534) internal successors, (6414), 3639 states have internal predecessors, (6414), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:19:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6647 transitions. [2024-10-11 04:19:35,145 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6647 transitions. Word has length 161 [2024-10-11 04:19:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:35,146 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6647 transitions. [2024-10-11 04:19:35,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6647 transitions. [2024-10-11 04:19:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:35,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:35,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:35,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:19:35,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:35,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1011032963, now seen corresponding path program 1 times [2024-10-11 04:19:35,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:35,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900574894] [2024-10-11 04:19:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:35,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:35,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:35,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900574894] [2024-10-11 04:19:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900574894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:35,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:35,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025490214] [2024-10-11 04:19:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:35,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:35,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:35,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:35,489 INFO L87 Difference]: Start difference. First operand 3779 states and 6647 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:37,676 INFO L93 Difference]: Finished difference Result 6107 states and 10536 transitions. [2024-10-11 04:19:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:37,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:37,699 INFO L225 Difference]: With dead ends: 6107 [2024-10-11 04:19:37,699 INFO L226 Difference]: Without dead ends: 4467 [2024-10-11 04:19:37,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:37,709 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5036 mSDsluCounter, 16601 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5056 SdHoareTripleChecker+Valid, 20809 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:37,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5056 Valid, 20809 Invalid, 1945 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:19:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2024-10-11 04:19:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 3779. [2024-10-11 04:19:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3633 states have (on average 1.7641067987888797) internal successors, (6409), 3639 states have internal predecessors, (6409), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:19:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6642 transitions. [2024-10-11 04:19:37,874 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6642 transitions. Word has length 161 [2024-10-11 04:19:37,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:37,876 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6642 transitions. [2024-10-11 04:19:37,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6642 transitions. [2024-10-11 04:19:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:37,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:37,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:37,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:19:37,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:37,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 387920639, now seen corresponding path program 1 times [2024-10-11 04:19:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:37,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144386999] [2024-10-11 04:19:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:38,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:38,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:38,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:38,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144386999] [2024-10-11 04:19:38,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144386999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:38,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:38,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:38,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187723907] [2024-10-11 04:19:38,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:38,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:38,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:38,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:38,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:38,192 INFO L87 Difference]: Start difference. First operand 3779 states and 6642 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:41,852 INFO L93 Difference]: Finished difference Result 7839 states and 13357 transitions. [2024-10-11 04:19:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:41,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:41,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:41,878 INFO L225 Difference]: With dead ends: 7839 [2024-10-11 04:19:41,879 INFO L226 Difference]: Without dead ends: 6199 [2024-10-11 04:19:41,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:41,889 INFO L432 NwaCegarLoop]: 4417 mSDtfsCounter, 5453 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3646 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5472 SdHoareTripleChecker+Valid, 21775 SdHoareTripleChecker+Invalid, 3709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:41,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5472 Valid, 21775 Invalid, 3709 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3646 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:19:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6199 states. [2024-10-11 04:19:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6199 to 5080. [2024-10-11 04:19:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4822 states have (on average 1.7254251347988387) internal successors, (8320), 4832 states have internal predecessors, (8320), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 04:19:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 8743 transitions. [2024-10-11 04:19:42,143 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 8743 transitions. Word has length 161 [2024-10-11 04:19:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:42,144 INFO L471 AbstractCegarLoop]: Abstraction has 5080 states and 8743 transitions. [2024-10-11 04:19:42,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 8743 transitions. [2024-10-11 04:19:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:42,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:42,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:42,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:19:42,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:42,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:42,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1229519811, now seen corresponding path program 1 times [2024-10-11 04:19:42,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182715101] [2024-10-11 04:19:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:42,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182715101] [2024-10-11 04:19:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182715101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:42,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676812123] [2024-10-11 04:19:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:42,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:42,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:42,602 INFO L87 Difference]: Start difference. First operand 5080 states and 8743 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:44,844 INFO L93 Difference]: Finished difference Result 9165 states and 15533 transitions. [2024-10-11 04:19:44,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:44,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:44,872 INFO L225 Difference]: With dead ends: 9165 [2024-10-11 04:19:44,872 INFO L226 Difference]: Without dead ends: 6224 [2024-10-11 04:19:44,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:44,887 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5035 mSDsluCounter, 16601 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5055 SdHoareTripleChecker+Valid, 20809 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:44,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5055 Valid, 20809 Invalid, 1919 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:19:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2024-10-11 04:19:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 5080. [2024-10-11 04:19:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4822 states have (on average 1.7235586893405226) internal successors, (8311), 4832 states have internal predecessors, (8311), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 04:19:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 8734 transitions. [2024-10-11 04:19:45,120 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 8734 transitions. Word has length 161 [2024-10-11 04:19:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:45,120 INFO L471 AbstractCegarLoop]: Abstraction has 5080 states and 8734 transitions. [2024-10-11 04:19:45,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 8734 transitions. [2024-10-11 04:19:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:45,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:45,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:45,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:19:45,126 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:45,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash -866053313, now seen corresponding path program 1 times [2024-10-11 04:19:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:45,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741718727] [2024-10-11 04:19:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741718727] [2024-10-11 04:19:45,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741718727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:45,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472906497] [2024-10-11 04:19:45,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:45,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:45,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:45,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:45,418 INFO L87 Difference]: Start difference. First operand 5080 states and 8734 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:49,111 INFO L93 Difference]: Finished difference Result 12574 states and 21066 transitions. [2024-10-11 04:19:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:49,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:49,148 INFO L225 Difference]: With dead ends: 12574 [2024-10-11 04:19:49,149 INFO L226 Difference]: Without dead ends: 9633 [2024-10-11 04:19:49,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:49,164 INFO L432 NwaCegarLoop]: 4417 mSDtfsCounter, 5445 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5464 SdHoareTripleChecker+Valid, 21775 SdHoareTripleChecker+Invalid, 3671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:49,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5464 Valid, 21775 Invalid, 3671 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:19:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9633 states. [2024-10-11 04:19:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9633 to 7692. [2024-10-11 04:19:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7692 states, 7210 states have (on average 1.6828016643550625) internal successors, (12133), 7228 states have internal predecessors, (12133), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-11 04:19:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7692 states to 7692 states and 12954 transitions. [2024-10-11 04:19:49,520 INFO L78 Accepts]: Start accepts. Automaton has 7692 states and 12954 transitions. Word has length 161 [2024-10-11 04:19:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:49,521 INFO L471 AbstractCegarLoop]: Abstraction has 7692 states and 12954 transitions. [2024-10-11 04:19:49,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 7692 states and 12954 transitions. [2024-10-11 04:19:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:49,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:49,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:49,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:19:49,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:49,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash -577233923, now seen corresponding path program 1 times [2024-10-11 04:19:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:49,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112859394] [2024-10-11 04:19:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:49,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:49,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:49,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112859394] [2024-10-11 04:19:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112859394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:49,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:49,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780789858] [2024-10-11 04:19:49,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:49,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:49,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:49,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:49,791 INFO L87 Difference]: Start difference. First operand 7692 states and 12954 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:53,786 INFO L93 Difference]: Finished difference Result 22060 states and 36616 transitions. [2024-10-11 04:19:53,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:53,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:53,864 INFO L225 Difference]: With dead ends: 22060 [2024-10-11 04:19:53,864 INFO L226 Difference]: Without dead ends: 16507 [2024-10-11 04:19:53,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:53,897 INFO L432 NwaCegarLoop]: 4417 mSDtfsCounter, 5444 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5463 SdHoareTripleChecker+Valid, 21775 SdHoareTripleChecker+Invalid, 3658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:53,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5463 Valid, 21775 Invalid, 3658 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:19:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16507 states. [2024-10-11 04:19:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16507 to 12929. [2024-10-11 04:19:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12929 states, 11999 states have (on average 1.6497208100675056) internal successors, (19795), 12033 states have internal predecessors, (19795), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-11 04:19:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12929 states to 12929 states and 21466 transitions. [2024-10-11 04:19:54,578 INFO L78 Accepts]: Start accepts. Automaton has 12929 states and 21466 transitions. Word has length 161 [2024-10-11 04:19:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:54,579 INFO L471 AbstractCegarLoop]: Abstraction has 12929 states and 21466 transitions. [2024-10-11 04:19:54,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 12929 states and 21466 transitions. [2024-10-11 04:19:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:19:54,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:54,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:54,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:19:54,590 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:54,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1122106497, now seen corresponding path program 1 times [2024-10-11 04:19:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720835468] [2024-10-11 04:19:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:54,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:54,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:19:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:19:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:54,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:19:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:19:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720835468] [2024-10-11 04:19:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720835468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:54,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:54,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755969678] [2024-10-11 04:19:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:54,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:54,886 INFO L87 Difference]: Start difference. First operand 12929 states and 21466 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:59,371 INFO L93 Difference]: Finished difference Result 41031 states and 67906 transitions. [2024-10-11 04:19:59,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:59,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:19:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:59,501 INFO L225 Difference]: With dead ends: 41031 [2024-10-11 04:19:59,502 INFO L226 Difference]: Without dead ends: 30241 [2024-10-11 04:19:59,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:59,553 INFO L432 NwaCegarLoop]: 4230 mSDtfsCounter, 5541 mSDsluCounter, 16851 mSDsCounter, 0 mSdLazyCounter, 2997 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5560 SdHoareTripleChecker+Valid, 21081 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:59,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5560 Valid, 21081 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2997 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:19:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30241 states. [2024-10-11 04:20:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30241 to 23434. [2024-10-11 04:20:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23434 states, 21608 states have (on average 1.6274065161051463) internal successors, (35165), 21674 states have internal predecessors, (35165), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 04:20:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23434 states to 23434 states and 38698 transitions. [2024-10-11 04:20:01,021 INFO L78 Accepts]: Start accepts. Automaton has 23434 states and 38698 transitions. Word has length 161 [2024-10-11 04:20:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:01,022 INFO L471 AbstractCegarLoop]: Abstraction has 23434 states and 38698 transitions. [2024-10-11 04:20:01,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 23434 states and 38698 transitions. [2024-10-11 04:20:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:20:01,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:01,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:20:01,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash -446946371, now seen corresponding path program 1 times [2024-10-11 04:20:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:01,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435562232] [2024-10-11 04:20:01,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:20:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:20:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:01,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:20:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:01,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:20:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:01,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:01,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435562232] [2024-10-11 04:20:01,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435562232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:01,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:01,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513129227] [2024-10-11 04:20:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:01,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:01,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:01,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:01,280 INFO L87 Difference]: Start difference. First operand 23434 states and 38698 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:04,517 INFO L93 Difference]: Finished difference Result 51969 states and 86648 transitions. [2024-10-11 04:20:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:20:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 04:20:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:04,651 INFO L225 Difference]: With dead ends: 51969 [2024-10-11 04:20:04,652 INFO L226 Difference]: Without dead ends: 30674 [2024-10-11 04:20:04,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:20:04,706 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5194 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5214 SdHoareTripleChecker+Valid, 16690 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:04,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5214 Valid, 16690 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:20:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30674 states. [2024-10-11 04:20:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30674 to 23434. [2024-10-11 04:20:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23434 states, 21608 states have (on average 1.6243983709737135) internal successors, (35100), 21674 states have internal predecessors, (35100), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 04:20:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23434 states to 23434 states and 38633 transitions. [2024-10-11 04:20:06,226 INFO L78 Accepts]: Start accepts. Automaton has 23434 states and 38633 transitions. Word has length 161 [2024-10-11 04:20:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:06,227 INFO L471 AbstractCegarLoop]: Abstraction has 23434 states and 38633 transitions. [2024-10-11 04:20:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 23434 states and 38633 transitions. [2024-10-11 04:20:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 04:20:06,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:06,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:06,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:20:06,244 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:06,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1394998337, now seen corresponding path program 1 times [2024-10-11 04:20:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767803620] [2024-10-11 04:20:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:06,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:20:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:20:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:20:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:06,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:20:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:06,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:06,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767803620] [2024-10-11 04:20:06,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767803620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:06,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:06,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:06,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302360144] [2024-10-11 04:20:06,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:06,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:06,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:06,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:06,494 INFO L87 Difference]: Start difference. First operand 23434 states and 38633 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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)