./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_label43+token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:15:02,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:15:02,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:15:03,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:15:03,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:15:03,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:15:03,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:15:03,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:15:03,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:15:03,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:15:03,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:15:03,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:15:03,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:15:03,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:15:03,044 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:15:03,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:15:03,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:15:03,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:15:03,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:15:03,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:15:03,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:15:03,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:15:03,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:15:03,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:15:03,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:15:03,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:15:03,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:15:03,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:15:03,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:15:03,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:15:03,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:15:03,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:15:03,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:15:03,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:15:03,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:15:03,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:15:03,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:15:03,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:15:03,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:15:03,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:15:03,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:15:03,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:15:03,056 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 [2024-10-24 02:15:03,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:15:03,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:15:03,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:15:03,299 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:15:03,299 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:15:03,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c [2024-10-24 02:15:04,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:15:05,117 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:15:05,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c [2024-10-24 02:15:05,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d07e25ed/3234d465c9fd49b5b33a42f330a10e5c/FLAG42ccef6c8 [2024-10-24 02:15:05,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d07e25ed/3234d465c9fd49b5b33a42f330a10e5c [2024-10-24 02:15:05,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:15:05,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:15:05,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:15:05,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:15:05,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:15:05,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:15:05" (1/1) ... [2024-10-24 02:15:05,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2284c39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:05, skipping insertion in model container [2024-10-24 02:15:05,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:15:05" (1/1) ... [2024-10-24 02:15:05,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:15:06,633 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_label43+token_ring.04.cil-2.c[381679,381692] [2024-10-24 02:15:06,658 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_label43+token_ring.04.cil-2.c[383339,383352] [2024-10-24 02:15:06,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:15:06,821 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:15:07,427 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_label43+token_ring.04.cil-2.c[381679,381692] [2024-10-24 02:15:07,431 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_label43+token_ring.04.cil-2.c[383339,383352] [2024-10-24 02:15:07,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:15:07,491 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:15:07,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07 WrapperNode [2024-10-24 02:15:07,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:15:07,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:15:07,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:15:07,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:15:07,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:07,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:07,880 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12759 [2024-10-24 02:15:07,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:15:07,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:15:07,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:15:07,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:15:07,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:07,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:08,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:08,101 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-24 02:15:08,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:08,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:08,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:08,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:08,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:08,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:08,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:15:08,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:15:08,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:15:08,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:15:08,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (1/1) ... [2024-10-24 02:15:08,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:15:08,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:08,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 02:15:08,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 02:15:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:15:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 02:15:08,427 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 02:15:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 02:15:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 02:15:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 02:15:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 02:15:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-24 02:15:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-24 02:15:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 02:15:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 02:15:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 02:15:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 02:15:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 02:15:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 02:15:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:15:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:15:08,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:15:08,527 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:15:08,529 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:15:14,485 INFO L? ?]: Removed 1711 outVars from TransFormulas that were not future-live. [2024-10-24 02:15:14,486 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:15:14,584 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:15:14,585 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-24 02:15:14,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:15:14 BoogieIcfgContainer [2024-10-24 02:15:14,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:15:14,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:15:14,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:15:14,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:15:14,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:15:05" (1/3) ... [2024-10-24 02:15:14,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbdf9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:15:14, skipping insertion in model container [2024-10-24 02:15:14,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:07" (2/3) ... [2024-10-24 02:15:14,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbdf9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:15:14, skipping insertion in model container [2024-10-24 02:15:14,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:15:14" (3/3) ... [2024-10-24 02:15:14,594 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.04.cil-2.c [2024-10-24 02:15:14,607 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:15:14,608 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:15:14,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:15:14,716 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;@364ed63b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:15:14,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:15:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 2295 states, 2265 states have (on average 1.8838852097130243) internal successors, (4267), 2270 states have internal predecessors, (4267), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 02:15:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:14,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:14,738 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] [2024-10-24 02:15:14,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:14,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1308670140, now seen corresponding path program 1 times [2024-10-24 02:15:14,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843864334] [2024-10-24 02:15:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:14,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:15,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:15,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:15,136 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-24 02:15:15,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:15,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843864334] [2024-10-24 02:15:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843864334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:15,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:15,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:15:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496517333] [2024-10-24 02:15:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:15,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:15:15,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:15:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:15:15,179 INFO L87 Difference]: Start difference. First operand has 2295 states, 2265 states have (on average 1.8838852097130243) internal successors, (4267), 2270 states have internal predecessors, (4267), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:16,055 INFO L93 Difference]: Finished difference Result 4635 states and 8694 transitions. [2024-10-24 02:15:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:15:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:16,080 INFO L225 Difference]: With dead ends: 4635 [2024-10-24 02:15:16,080 INFO L226 Difference]: Without dead ends: 2340 [2024-10-24 02:15:16,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:15:16,092 INFO L432 NwaCegarLoop]: 4116 mSDtfsCounter, 425 mSDsluCounter, 12046 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 16162 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:16,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 16162 Invalid, 491 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 02:15:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2024-10-24 02:15:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2290. [2024-10-24 02:15:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 2262 states have (on average 1.8492484526967286) internal successors, (4183), 2265 states have internal predecessors, (4183), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 02:15:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 4221 transitions. [2024-10-24 02:15:16,222 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 4221 transitions. Word has length 82 [2024-10-24 02:15:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:16,223 INFO L471 AbstractCegarLoop]: Abstraction has 2290 states and 4221 transitions. [2024-10-24 02:15:16,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 4221 transitions. [2024-10-24 02:15:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:16,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:16,227 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] [2024-10-24 02:15:16,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:15:16,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:16,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash -425434310, now seen corresponding path program 1 times [2024-10-24 02:15:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316715834] [2024-10-24 02:15:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:16,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:16,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:16,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:16,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:16,442 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-24 02:15:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316715834] [2024-10-24 02:15:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316715834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 02:15:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091648232] [2024-10-24 02:15:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:16,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 02:15:16,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:16,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 02:15:16,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:15:16,446 INFO L87 Difference]: Start difference. First operand 2290 states and 4221 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:17,525 INFO L93 Difference]: Finished difference Result 2711 states and 4899 transitions. [2024-10-24 02:15:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 02:15:17,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:17,538 INFO L225 Difference]: With dead ends: 2711 [2024-10-24 02:15:17,538 INFO L226 Difference]: Without dead ends: 2552 [2024-10-24 02:15:17,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:15:17,541 INFO L432 NwaCegarLoop]: 4097 mSDtfsCounter, 4578 mSDsluCounter, 12271 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 16368 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:17,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 16368 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 02:15:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2024-10-24 02:15:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2451. [2024-10-24 02:15:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2403 states have (on average 1.834789846025801) internal successors, (4409), 2407 states have internal predecessors, (4409), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-24 02:15:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 4476 transitions. [2024-10-24 02:15:17,601 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 4476 transitions. Word has length 82 [2024-10-24 02:15:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:17,602 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 4476 transitions. [2024-10-24 02:15:17,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 4476 transitions. [2024-10-24 02:15:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:17,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:17,605 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] [2024-10-24 02:15:17,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:15:17,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1427533574, now seen corresponding path program 1 times [2024-10-24 02:15:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114366081] [2024-10-24 02:15:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:17,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:17,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:17,757 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-24 02:15:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114366081] [2024-10-24 02:15:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114366081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:17,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:17,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:15:17,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012880925] [2024-10-24 02:15:17,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:17,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:15:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:17,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:15:17,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:17,759 INFO L87 Difference]: Start difference. First operand 2451 states and 4476 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:19,135 INFO L93 Difference]: Finished difference Result 3086 states and 5493 transitions. [2024-10-24 02:15:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:15:19,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:19,146 INFO L225 Difference]: With dead ends: 3086 [2024-10-24 02:15:19,147 INFO L226 Difference]: Without dead ends: 2766 [2024-10-24 02:15:19,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:15:19,149 INFO L432 NwaCegarLoop]: 4202 mSDtfsCounter, 4581 mSDsluCounter, 16604 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4592 SdHoareTripleChecker+Valid, 20806 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:19,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4592 Valid, 20806 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 02:15:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2024-10-24 02:15:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2601. [2024-10-24 02:15:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 2533 states have (on average 1.8211606790367154) internal successors, (4613), 2538 states have internal predecessors, (4613), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-24 02:15:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 4708 transitions. [2024-10-24 02:15:19,212 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 4708 transitions. Word has length 82 [2024-10-24 02:15:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:19,212 INFO L471 AbstractCegarLoop]: Abstraction has 2601 states and 4708 transitions. [2024-10-24 02:15:19,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 4708 transitions. [2024-10-24 02:15:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:19,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:19,214 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] [2024-10-24 02:15:19,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:15:19,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:19,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash -473593416, now seen corresponding path program 1 times [2024-10-24 02:15:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:19,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575366427] [2024-10-24 02:15:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:19,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:19,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:19,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:19,373 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-24 02:15:19,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:19,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575366427] [2024-10-24 02:15:19,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575366427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:19,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:19,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:15:19,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339640316] [2024-10-24 02:15:19,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:19,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:15:19,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:19,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:15:19,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:19,375 INFO L87 Difference]: Start difference. First operand 2601 states and 4708 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:20,507 INFO L93 Difference]: Finished difference Result 3635 states and 6361 transitions. [2024-10-24 02:15:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:15:20,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:20,520 INFO L225 Difference]: With dead ends: 3635 [2024-10-24 02:15:20,520 INFO L226 Difference]: Without dead ends: 3165 [2024-10-24 02:15:20,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:15:20,526 INFO L432 NwaCegarLoop]: 4106 mSDtfsCounter, 4629 mSDsluCounter, 16349 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4640 SdHoareTripleChecker+Valid, 20455 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:20,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4640 Valid, 20455 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 02:15:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2024-10-24 02:15:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 2902. [2024-10-24 02:15:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2794 states have (on average 1.7974230493915533) internal successors, (5022), 2801 states have internal predecessors, (5022), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-24 02:15:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 5177 transitions. [2024-10-24 02:15:20,614 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 5177 transitions. Word has length 82 [2024-10-24 02:15:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:20,615 INFO L471 AbstractCegarLoop]: Abstraction has 2902 states and 5177 transitions. [2024-10-24 02:15:20,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:20,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 5177 transitions. [2024-10-24 02:15:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:20,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:20,618 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] [2024-10-24 02:15:20,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:15:20,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:20,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1689747142, now seen corresponding path program 1 times [2024-10-24 02:15:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:20,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227185394] [2024-10-24 02:15:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:20,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:20,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:20,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:20,746 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-24 02:15:20,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:20,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227185394] [2024-10-24 02:15:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227185394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:20,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:20,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:15:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105116794] [2024-10-24 02:15:20,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:20,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:15:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:20,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:15:20,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:20,748 INFO L87 Difference]: Start difference. First operand 2902 states and 5177 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:21,337 INFO L93 Difference]: Finished difference Result 3924 states and 6821 transitions. [2024-10-24 02:15:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:15:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:21,349 INFO L225 Difference]: With dead ends: 3924 [2024-10-24 02:15:21,349 INFO L226 Difference]: Without dead ends: 3153 [2024-10-24 02:15:21,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:15:21,353 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 4496 mSDsluCounter, 12167 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4508 SdHoareTripleChecker+Valid, 16251 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:21,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4508 Valid, 16251 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 02:15:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2024-10-24 02:15:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2902. [2024-10-24 02:15:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2794 states have (on average 1.7956335003579098) internal successors, (5017), 2801 states have internal predecessors, (5017), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-24 02:15:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 5172 transitions. [2024-10-24 02:15:21,432 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 5172 transitions. Word has length 82 [2024-10-24 02:15:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:21,432 INFO L471 AbstractCegarLoop]: Abstraction has 2902 states and 5172 transitions. [2024-10-24 02:15:21,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 5172 transitions. [2024-10-24 02:15:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:21,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:21,433 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] [2024-10-24 02:15:21,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:15:21,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:21,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1873252728, now seen corresponding path program 1 times [2024-10-24 02:15:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073726236] [2024-10-24 02:15:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:21,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:21,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:21,620 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-24 02:15:21,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:21,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073726236] [2024-10-24 02:15:21,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073726236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:21,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:21,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:15:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716235887] [2024-10-24 02:15:21,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:21,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:15:21,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:15:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:21,623 INFO L87 Difference]: Start difference. First operand 2902 states and 5172 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:22,947 INFO L93 Difference]: Finished difference Result 4905 states and 8338 transitions. [2024-10-24 02:15:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:15:22,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:22,964 INFO L225 Difference]: With dead ends: 4905 [2024-10-24 02:15:22,964 INFO L226 Difference]: Without dead ends: 4134 [2024-10-24 02:15:22,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:15:22,971 INFO L432 NwaCegarLoop]: 4198 mSDtfsCounter, 4725 mSDsluCounter, 16599 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4741 SdHoareTripleChecker+Valid, 20797 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:22,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4741 Valid, 20797 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 02:15:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2024-10-24 02:15:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 3506. [2024-10-24 02:15:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3506 states, 3322 states have (on average 1.7585791691751957) internal successors, (5842), 3333 states have internal predecessors, (5842), 120 states have call successors, (120), 55 states have call predecessors, (120), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-24 02:15:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 6115 transitions. [2024-10-24 02:15:23,092 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 6115 transitions. Word has length 82 [2024-10-24 02:15:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:23,092 INFO L471 AbstractCegarLoop]: Abstraction has 3506 states and 6115 transitions. [2024-10-24 02:15:23,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 6115 transitions. [2024-10-24 02:15:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:23,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:23,094 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] [2024-10-24 02:15:23,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 02:15:23,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:23,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1818859830, now seen corresponding path program 1 times [2024-10-24 02:15:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366009473] [2024-10-24 02:15:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:23,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:23,201 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-24 02:15:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366009473] [2024-10-24 02:15:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366009473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:23,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:23,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:15:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276676452] [2024-10-24 02:15:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:23,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:15:23,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:23,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:15:23,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:23,205 INFO L87 Difference]: Start difference. First operand 3506 states and 6115 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:24,685 INFO L93 Difference]: Finished difference Result 7133 states and 11845 transitions. [2024-10-24 02:15:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:15:24,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:24,705 INFO L225 Difference]: With dead ends: 7133 [2024-10-24 02:15:24,705 INFO L226 Difference]: Without dead ends: 5758 [2024-10-24 02:15:24,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:15:24,710 INFO L432 NwaCegarLoop]: 4197 mSDtfsCounter, 4598 mSDsluCounter, 16596 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4608 SdHoareTripleChecker+Valid, 20793 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:24,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4608 Valid, 20793 Invalid, 1769 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 02:15:24,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2024-10-24 02:15:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 4629. [2024-10-24 02:15:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 4297 states have (on average 1.7095648126599954) internal successors, (7346), 4316 states have internal predecessors, (7346), 212 states have call successors, (212), 103 states have call predecessors, (212), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-24 02:15:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 7865 transitions. [2024-10-24 02:15:24,868 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 7865 transitions. Word has length 82 [2024-10-24 02:15:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:24,868 INFO L471 AbstractCegarLoop]: Abstraction has 4629 states and 7865 transitions. [2024-10-24 02:15:24,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 7865 transitions. [2024-10-24 02:15:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:24,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:24,872 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] [2024-10-24 02:15:24,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 02:15:24,872 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:24,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1401463224, now seen corresponding path program 1 times [2024-10-24 02:15:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:24,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665318423] [2024-10-24 02:15:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:24,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:24,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:24,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:24,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:24,989 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-24 02:15:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665318423] [2024-10-24 02:15:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665318423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:15:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521357989] [2024-10-24 02:15:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:24,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:15:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:24,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:15:24,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:24,997 INFO L87 Difference]: Start difference. First operand 4629 states and 7865 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:26,385 INFO L93 Difference]: Finished difference Result 11234 states and 18285 transitions. [2024-10-24 02:15:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:15:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:26,419 INFO L225 Difference]: With dead ends: 11234 [2024-10-24 02:15:26,421 INFO L226 Difference]: Without dead ends: 8736 [2024-10-24 02:15:26,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:15:26,432 INFO L432 NwaCegarLoop]: 4198 mSDtfsCounter, 4653 mSDsluCounter, 16599 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 20797 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:26,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 20797 Invalid, 1529 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 02:15:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8736 states. [2024-10-24 02:15:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8736 to 6954. [2024-10-24 02:15:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6954 states, 6334 states have (on average 1.6596147773918535) internal successors, (10512), 6369 states have internal predecessors, (10512), 388 states have call successors, (388), 199 states have call predecessors, (388), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-24 02:15:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6954 states to 6954 states and 11561 transitions. [2024-10-24 02:15:26,892 INFO L78 Accepts]: Start accepts. Automaton has 6954 states and 11561 transitions. Word has length 82 [2024-10-24 02:15:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:26,892 INFO L471 AbstractCegarLoop]: Abstraction has 6954 states and 11561 transitions. [2024-10-24 02:15:26,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6954 states and 11561 transitions. [2024-10-24 02:15:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:26,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:26,897 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] [2024-10-24 02:15:26,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 02:15:26,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:26,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2080735478, now seen corresponding path program 1 times [2024-10-24 02:15:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:26,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838849768] [2024-10-24 02:15:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:26,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:27,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:27,014 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-24 02:15:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838849768] [2024-10-24 02:15:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838849768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:27,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:27,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:15:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143321286] [2024-10-24 02:15:27,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:27,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:15:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:15:27,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:27,016 INFO L87 Difference]: Start difference. First operand 6954 states and 11561 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:28,698 INFO L93 Difference]: Finished difference Result 19421 states and 31383 transitions. [2024-10-24 02:15:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:15:28,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:28,746 INFO L225 Difference]: With dead ends: 19421 [2024-10-24 02:15:28,746 INFO L226 Difference]: Without dead ends: 14598 [2024-10-24 02:15:28,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:15:28,762 INFO L432 NwaCegarLoop]: 4198 mSDtfsCounter, 4617 mSDsluCounter, 16599 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4633 SdHoareTripleChecker+Valid, 20797 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:28,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4633 Valid, 20797 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 02:15:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2024-10-24 02:15:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 11603. [2024-10-24 02:15:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11603 states, 10423 states have (on average 1.618919696824331) internal successors, (16874), 10490 states have internal predecessors, (16874), 724 states have call successors, (724), 391 states have call predecessors, (724), 454 states have return successors, (1515), 785 states have call predecessors, (1515), 722 states have call successors, (1515) [2024-10-24 02:15:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11603 states to 11603 states and 19113 transitions. [2024-10-24 02:15:29,253 INFO L78 Accepts]: Start accepts. Automaton has 11603 states and 19113 transitions. Word has length 82 [2024-10-24 02:15:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:29,254 INFO L471 AbstractCegarLoop]: Abstraction has 11603 states and 19113 transitions. [2024-10-24 02:15:29,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11603 states and 19113 transitions. [2024-10-24 02:15:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:29,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:29,262 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] [2024-10-24 02:15:29,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 02:15:29,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:29,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash -252657160, now seen corresponding path program 1 times [2024-10-24 02:15:29,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213685766] [2024-10-24 02:15:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:29,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:29,365 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-24 02:15:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213685766] [2024-10-24 02:15:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213685766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:29,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:29,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:15:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835894002] [2024-10-24 02:15:29,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:29,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:15:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:29,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:15:29,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:29,368 INFO L87 Difference]: Start difference. First operand 11603 states and 19113 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:31,607 INFO L93 Difference]: Finished difference Result 35280 states and 57361 transitions. [2024-10-24 02:15:31,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:15:31,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:31,697 INFO L225 Difference]: With dead ends: 35280 [2024-10-24 02:15:31,698 INFO L226 Difference]: Without dead ends: 25808 [2024-10-24 02:15:31,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:15:31,727 INFO L432 NwaCegarLoop]: 4188 mSDtfsCounter, 4566 mSDsluCounter, 16587 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4576 SdHoareTripleChecker+Valid, 20775 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:31,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4576 Valid, 20775 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 02:15:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25808 states. [2024-10-24 02:15:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25808 to 20888. [2024-10-24 02:15:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20888 states, 18628 states have (on average 1.5920120249087395) internal successors, (29656), 18759 states have internal predecessors, (29656), 1360 states have call successors, (1360), 771 states have call predecessors, (1360), 898 states have return successors, (3673), 1485 states have call predecessors, (3673), 1358 states have call successors, (3673) [2024-10-24 02:15:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20888 states to 20888 states and 34689 transitions. [2024-10-24 02:15:33,089 INFO L78 Accepts]: Start accepts. Automaton has 20888 states and 34689 transitions. Word has length 82 [2024-10-24 02:15:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:33,090 INFO L471 AbstractCegarLoop]: Abstraction has 20888 states and 34689 transitions. [2024-10-24 02:15:33,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20888 states and 34689 transitions. [2024-10-24 02:15:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 02:15:33,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:33,110 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] [2024-10-24 02:15:33,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 02:15:33,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:33,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash -50833226, now seen corresponding path program 1 times [2024-10-24 02:15:33,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:33,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760695290] [2024-10-24 02:15:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:33,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:33,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:33,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:33,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:33,216 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-24 02:15:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760695290] [2024-10-24 02:15:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760695290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:33,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:15:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 02:15:33,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717600207] [2024-10-24 02:15:33,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:33,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 02:15:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:33,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 02:15:33,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:15:33,218 INFO L87 Difference]: Start difference. First operand 20888 states and 34689 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:35,636 INFO L93 Difference]: Finished difference Result 54910 states and 89680 transitions. [2024-10-24 02:15:35,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 02:15:35,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-24 02:15:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:35,758 INFO L225 Difference]: With dead ends: 54910 [2024-10-24 02:15:35,758 INFO L226 Difference]: Without dead ends: 36154 [2024-10-24 02:15:35,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 02:15:35,813 INFO L432 NwaCegarLoop]: 4224 mSDtfsCounter, 4757 mSDsluCounter, 12336 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 16560 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:35,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 16560 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 02:15:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36154 states. [2024-10-24 02:15:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36154 to 30017. [2024-10-24 02:15:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30017 states, 26585 states have (on average 1.5682527741207448) internal successors, (41692), 26845 states have internal predecessors, (41692), 2078 states have call successors, (2078), 1161 states have call predecessors, (2078), 1352 states have return successors, (5121), 2138 states have call predecessors, (5121), 2076 states have call successors, (5121) [2024-10-24 02:15:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30017 states to 30017 states and 48891 transitions. [2024-10-24 02:15:37,449 INFO L78 Accepts]: Start accepts. Automaton has 30017 states and 48891 transitions. Word has length 82 [2024-10-24 02:15:37,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:37,449 INFO L471 AbstractCegarLoop]: Abstraction has 30017 states and 48891 transitions. [2024-10-24 02:15:37,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:15:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 30017 states and 48891 transitions. [2024-10-24 02:15:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 02:15:37,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:37,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:15:37,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 02:15:37,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:37,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:37,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1489308341, now seen corresponding path program 1 times [2024-10-24 02:15:37,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:37,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32398027] [2024-10-24 02:15:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 02:15:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 02:15:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 02:15:37,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:37,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32398027] [2024-10-24 02:15:37,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32398027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:15:37,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797167398] [2024-10-24 02:15:37,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:37,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:37,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:37,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:15:37,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 02:15:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:37,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 02:15:37,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 02:15:37,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797167398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:37,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 02:15:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373126049] [2024-10-24 02:15:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:37,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:15:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:15:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:37,839 INFO L87 Difference]: Start difference. First operand 30017 states and 48891 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 02:15:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:41,101 INFO L93 Difference]: Finished difference Result 85190 states and 138511 transitions. [2024-10-24 02:15:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:15:41,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 132 [2024-10-24 02:15:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:41,299 INFO L225 Difference]: With dead ends: 85190 [2024-10-24 02:15:41,299 INFO L226 Difference]: Without dead ends: 57305 [2024-10-24 02:15:41,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:41,364 INFO L432 NwaCegarLoop]: 4196 mSDtfsCounter, 4169 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4169 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:41,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4169 Valid, 4415 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:15:41,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57305 states. [2024-10-24 02:15:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57305 to 57107. [2024-10-24 02:15:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57107 states, 50357 states have (on average 1.5518597215878627) internal successors, (78147), 50874 states have internal predecessors, (78147), 4048 states have call successors, (4048), 2317 states have call predecessors, (4048), 2700 states have return successors, (10009), 4043 states have call predecessors, (10009), 4046 states have call successors, (10009) [2024-10-24 02:15:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57107 states to 57107 states and 92204 transitions. [2024-10-24 02:15:44,774 INFO L78 Accepts]: Start accepts. Automaton has 57107 states and 92204 transitions. Word has length 132 [2024-10-24 02:15:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:15:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 57107 states and 92204 transitions. [2024-10-24 02:15:44,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 02:15:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 57107 states and 92204 transitions. [2024-10-24 02:15:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 02:15:44,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:44,881 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:15:44,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 02:15:45,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 02:15:45,082 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:45,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1791656555, now seen corresponding path program 1 times [2024-10-24 02:15:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:45,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845412031] [2024-10-24 02:15:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 02:15:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 02:15:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 02:15:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 02:15:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 02:15:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 02:15:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 02:15:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 02:15:45,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:15:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845412031] [2024-10-24 02:15:45,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845412031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:15:45,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450596087] [2024-10-24 02:15:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:15:45,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:45,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:15:45,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 02:15:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:45,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 02:15:45,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:15:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 02:15:45,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:15:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450596087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:15:45,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:15:45,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 02:15:45,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745676785] [2024-10-24 02:15:45,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:15:45,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:15:45,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:15:45,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:15:45,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:45,390 INFO L87 Difference]: Start difference. First operand 57107 states and 92204 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 02:15:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:15:50,988 INFO L93 Difference]: Finished difference Result 165852 states and 268250 transitions. [2024-10-24 02:15:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:15:50,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 132 [2024-10-24 02:15:50,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:15:51,673 INFO L225 Difference]: With dead ends: 165852 [2024-10-24 02:15:51,674 INFO L226 Difference]: Without dead ends: 110877 [2024-10-24 02:15:51,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:15:51,781 INFO L432 NwaCegarLoop]: 4196 mSDtfsCounter, 4174 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4174 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:15:51,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4174 Valid, 4415 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:15:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110877 states. [2024-10-24 02:15:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110877 to 110485. [2024-10-24 02:15:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110485 states, 97213 states have (on average 1.5408124427802865) internal successors, (149787), 98244 states have internal predecessors, (149787), 7882 states have call successors, (7882), 4621 states have call predecessors, (7882), 5388 states have return successors, (19679), 7747 states have call predecessors, (19679), 7880 states have call successors, (19679)