./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.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.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 343a266e04a35949615e598ecd53205cd1ef95f44fcd29af6bf4976fff243198 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:25:31,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:25:31,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:25:31,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:25:31,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:25:31,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:25:31,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:25:31,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:25:31,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:25:31,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:25:31,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:25:31,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:25:31,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:25:31,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:25:31,428 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:25:31,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:25:31,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:25:31,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:25:31,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:25:31,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:25:31,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:25:31,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:25:31,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:25:31,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:25:31,434 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:25:31,435 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:25:31,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:25:31,435 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:25:31,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:25:31,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:25:31,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:25:31,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:25:31,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:25:31,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:25:31,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:25:31,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:25:31,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:25:31,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:25:31,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:25:31,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:25:31,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:25:31,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:25:31,440 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 -> 343a266e04a35949615e598ecd53205cd1ef95f44fcd29af6bf4976fff243198 [2024-10-14 04:25:31,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:25:31,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:25:31,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:25:31,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:25:31,719 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:25:31,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c [2024-10-14 04:25:33,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:25:33,892 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:25:33,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c [2024-10-14 04:25:33,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdd109db1/234f6addebc44210abb8536f396d7249/FLAG25015b2c0 [2024-10-14 04:25:34,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdd109db1/234f6addebc44210abb8536f396d7249 [2024-10-14 04:25:34,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:25:34,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:25:34,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:25:34,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:25:34,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:25:34,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:25:34" (1/1) ... [2024-10-14 04:25:34,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569dcf3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:34, skipping insertion in model container [2024-10-14 04:25:34,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:25:34" (1/1) ... [2024-10-14 04:25:34,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:25:36,467 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.08.cil-2.c[381679,381692] [2024-10-14 04:25:36,496 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.08.cil-2.c[383339,383352] [2024-10-14 04:25:36,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:25:36,741 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:25:37,587 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.08.cil-2.c[381679,381692] [2024-10-14 04:25:37,593 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.08.cil-2.c[383339,383352] [2024-10-14 04:25:37,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:25:37,691 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:25:37,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37 WrapperNode [2024-10-14 04:25:37,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:25:37,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:25:37,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:25:37,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:25:37,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:37,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:38,325 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12999 [2024-10-14 04:25:38,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:25:38,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:25:38,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:25:38,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:25:38,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:38,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:38,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:38,601 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 04:25:38,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:38,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:38,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:38,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:38,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:38,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:39,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:25:39,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:25:39,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:25:39,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:25:39,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (1/1) ... [2024-10-14 04:25:39,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:25:39,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:25:39,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:25:39,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:25:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:25:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:25:39,220 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:25:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:25:39,222 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:25:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:25:39,222 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:25:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-14 04:25:39,222 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-14 04:25:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:25:39,222 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:25:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:25:39,223 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:25:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:25:39,223 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:25:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:25:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:25:39,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:25:39,421 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:25:39,444 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:25:47,008 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-10-14 04:25:47,009 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:25:47,124 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:25:47,124 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-14 04:25:47,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:25:47 BoogieIcfgContainer [2024-10-14 04:25:47,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:25:47,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:25:47,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:25:47,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:25:47,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:25:34" (1/3) ... [2024-10-14 04:25:47,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117493bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:25:47, skipping insertion in model container [2024-10-14 04:25:47,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:25:37" (2/3) ... [2024-10-14 04:25:47,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117493bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:25:47, skipping insertion in model container [2024-10-14 04:25:47,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:25:47" (3/3) ... [2024-10-14 04:25:47,135 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.08.cil-2.c [2024-10-14 04:25:47,152 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:25:47,152 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:25:47,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:25:47,274 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;@5a7809aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:25:47,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:25:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 2387 states, 2353 states have (on average 1.87972800679983) internal successors, (4423), 2358 states have internal predecessors, (4423), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 04:25:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:25:47,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:25:47,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:25:47,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:25:47,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:25:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2069738272, now seen corresponding path program 1 times [2024-10-14 04:25:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:25:47,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210699232] [2024-10-14 04:25:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:25:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:25:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:25:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:25:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:47,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:25:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:47,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:25:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:25:47,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:25:47,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210699232] [2024-10-14 04:25:47,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210699232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:25:47,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:25:47,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:25:47,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580673304] [2024-10-14 04:25:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:25:47,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:25:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:25:47,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:25:47,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:25:47,945 INFO L87 Difference]: Start difference. First operand has 2387 states, 2353 states have (on average 1.87972800679983) internal successors, (4423), 2358 states have internal predecessors, (4423), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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-14 04:25:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:25:49,656 INFO L93 Difference]: Finished difference Result 4859 states and 9094 transitions. [2024-10-14 04:25:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:25:49,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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 122 [2024-10-14 04:25:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:25:49,690 INFO L225 Difference]: With dead ends: 4859 [2024-10-14 04:25:49,690 INFO L226 Difference]: Without dead ends: 2472 [2024-10-14 04:25:49,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:25:49,709 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 709 mSDsluCounter, 12134 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 16326 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:25:49,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 16326 Invalid, 811 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 04:25:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2024-10-14 04:25:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2382. [2024-10-14 04:25:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2350 states have (on average 1.8429787234042554) internal successors, (4331), 2353 states have internal predecessors, (4331), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 04:25:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 4377 transitions. [2024-10-14 04:25:49,893 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 4377 transitions. Word has length 122 [2024-10-14 04:25:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:25:49,894 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 4377 transitions. [2024-10-14 04:25:49,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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-14 04:25:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 4377 transitions. [2024-10-14 04:25:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:25:49,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:25:49,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:25:49,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:25:49,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:25:49,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:25:49,901 INFO L85 PathProgramCache]: Analyzing trace with hash 140806046, now seen corresponding path program 1 times [2024-10-14 04:25:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:25:49,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255589797] [2024-10-14 04:25:49,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:25:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:25:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:25:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:50,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:25:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:25:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:25:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:25:50,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:25:50,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255589797] [2024-10-14 04:25:50,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255589797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:25:50,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:25:50,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:25:50,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622963076] [2024-10-14 04:25:50,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:25:50,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:25:50,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:25:50,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:25:50,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:25:50,270 INFO L87 Difference]: Start difference. First operand 2382 states and 4377 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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-14 04:25:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:25:52,668 INFO L93 Difference]: Finished difference Result 3067 states and 5511 transitions. [2024-10-14 04:25:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:25:52,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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 122 [2024-10-14 04:25:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:25:52,683 INFO L225 Difference]: With dead ends: 3067 [2024-10-14 04:25:52,683 INFO L226 Difference]: Without dead ends: 2820 [2024-10-14 04:25:52,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:25:52,687 INFO L432 NwaCegarLoop]: 4165 mSDtfsCounter, 5014 mSDsluCounter, 12483 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5029 SdHoareTripleChecker+Valid, 16648 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:25:52,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5029 Valid, 16648 Invalid, 1727 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 04:25:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2024-10-14 04:25:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2639. [2024-10-14 04:25:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2583 states have (on average 1.8246225319396052) internal successors, (4713), 2587 states have internal predecessors, (4713), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-14 04:25:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4796 transitions. [2024-10-14 04:25:52,786 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4796 transitions. Word has length 122 [2024-10-14 04:25:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:25:52,787 INFO L471 AbstractCegarLoop]: Abstraction has 2639 states and 4796 transitions. [2024-10-14 04:25:52,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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-14 04:25:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4796 transitions. [2024-10-14 04:25:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:25:52,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:25:52,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:25:52,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:25:52,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:25:52,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:25:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash -135119266, now seen corresponding path program 1 times [2024-10-14 04:25:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:25:52,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887008640] [2024-10-14 04:25:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:25:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:52,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:25:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:25:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:53,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:25:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:53,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:25:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:53,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:25:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:25:53,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:25:53,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887008640] [2024-10-14 04:25:53,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887008640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:25:53,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:25:53,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:25:53,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985628904] [2024-10-14 04:25:53,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:25:53,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:25:53,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:25:53,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:25:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:25:53,070 INFO L87 Difference]: Start difference. First operand 2639 states and 4796 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:25:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:25:56,068 INFO L93 Difference]: Finished difference Result 3682 states and 6521 transitions. [2024-10-14 04:25:56,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:25:56,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:25:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:25:56,084 INFO L225 Difference]: With dead ends: 3682 [2024-10-14 04:25:56,084 INFO L226 Difference]: Without dead ends: 3178 [2024-10-14 04:25:56,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:25:56,090 INFO L432 NwaCegarLoop]: 4322 mSDtfsCounter, 5033 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5048 SdHoareTripleChecker+Valid, 21346 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:25:56,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5048 Valid, 21346 Invalid, 2710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 04:25:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2024-10-14 04:25:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2877. [2024-10-14 04:25:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2797 states have (on average 1.8080085806220951) internal successors, (5057), 2802 states have internal predecessors, (5057), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-14 04:25:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 5176 transitions. [2024-10-14 04:25:56,201 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 5176 transitions. Word has length 122 [2024-10-14 04:25:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:25:56,203 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 5176 transitions. [2024-10-14 04:25:56,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:25:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 5176 transitions. [2024-10-14 04:25:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:25:56,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:25:56,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:25:56,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:25:56,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:25:56,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:25:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1254174748, now seen corresponding path program 1 times [2024-10-14 04:25:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:25:56,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346430016] [2024-10-14 04:25:56,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:25:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:25:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:56,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:25:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:56,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:25:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:56,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:25:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:56,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:25:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:25:56,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:25:56,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346430016] [2024-10-14 04:25:56,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346430016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:25:56,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:25:56,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:25:56,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271337871] [2024-10-14 04:25:56,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:25:56,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:25:56,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:25:56,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:25:56,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:25:56,477 INFO L87 Difference]: Start difference. First operand 2877 states and 5176 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:25:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:25:58,762 INFO L93 Difference]: Finished difference Result 4583 states and 7993 transitions. [2024-10-14 04:25:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:25:58,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:25:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:25:58,779 INFO L225 Difference]: With dead ends: 4583 [2024-10-14 04:25:58,779 INFO L226 Difference]: Without dead ends: 3841 [2024-10-14 04:25:58,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:25:58,783 INFO L432 NwaCegarLoop]: 4174 mSDtfsCounter, 5113 mSDsluCounter, 16625 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5128 SdHoareTripleChecker+Valid, 20799 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:25:58,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5128 Valid, 20799 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:25:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2024-10-14 04:25:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3354. [2024-10-14 04:25:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.7811531308121513) internal successors, (5746), 3233 states have internal predecessors, (5746), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-14 04:25:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5941 transitions. [2024-10-14 04:25:58,915 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5941 transitions. Word has length 122 [2024-10-14 04:25:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:25:58,916 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5941 transitions. [2024-10-14 04:25:58,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:25:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5941 transitions. [2024-10-14 04:25:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:25:58,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:25:58,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:25:58,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:25:58,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:25:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:25:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash -779219298, now seen corresponding path program 1 times [2024-10-14 04:25:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:25:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290037175] [2024-10-14 04:25:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:25:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:59,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:25:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:25:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:25:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:25:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:25:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:25:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:25:59,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:25:59,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290037175] [2024-10-14 04:25:59,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290037175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:25:59,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:25:59,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:25:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95056373] [2024-10-14 04:25:59,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:25:59,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:25:59,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:25:59,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:25:59,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:25:59,334 INFO L87 Difference]: Start difference. First operand 3354 states and 5941 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:26:00,708 INFO L93 Difference]: Finished difference Result 5048 states and 8749 transitions. [2024-10-14 04:26:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:26:00,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:26:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:26:00,725 INFO L225 Difference]: With dead ends: 5048 [2024-10-14 04:26:00,725 INFO L226 Difference]: Without dead ends: 3829 [2024-10-14 04:26:00,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:26:00,730 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4742 mSDsluCounter, 16424 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4758 SdHoareTripleChecker+Valid, 20576 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:26:00,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4758 Valid, 20576 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:26:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2024-10-14 04:26:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 3354. [2024-10-14 04:26:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.7796032238065715) internal successors, (5741), 3233 states have internal predecessors, (5741), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-14 04:26:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5936 transitions. [2024-10-14 04:26:00,847 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5936 transitions. Word has length 122 [2024-10-14 04:26:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:26:00,848 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5936 transitions. [2024-10-14 04:26:00,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5936 transitions. [2024-10-14 04:26:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:26:00,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:26:00,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:26:00,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:26:00,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:26:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:26:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1649039324, now seen corresponding path program 1 times [2024-10-14 04:26:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:26:00,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905638601] [2024-10-14 04:26:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:26:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:26:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:26:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:26:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:26:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:01,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:26:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:26:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:26:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:26:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905638601] [2024-10-14 04:26:01,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905638601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:26:01,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:26:01,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:26:01,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509760039] [2024-10-14 04:26:01,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:26:01,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:26:01,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:26:01,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:26:01,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:26:01,040 INFO L87 Difference]: Start difference. First operand 3354 states and 5936 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:26:02,067 INFO L93 Difference]: Finished difference Result 5037 states and 8713 transitions. [2024-10-14 04:26:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:26:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:26:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:26:02,083 INFO L225 Difference]: With dead ends: 5037 [2024-10-14 04:26:02,084 INFO L226 Difference]: Without dead ends: 3818 [2024-10-14 04:26:02,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:26:02,088 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4848 mSDsluCounter, 12339 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 16491 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:26:02,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 16491 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 04:26:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2024-10-14 04:26:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3354. [2024-10-14 04:26:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.778053316800992) internal successors, (5736), 3233 states have internal predecessors, (5736), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-14 04:26:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5931 transitions. [2024-10-14 04:26:02,207 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5931 transitions. Word has length 122 [2024-10-14 04:26:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:26:02,208 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5931 transitions. [2024-10-14 04:26:02,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5931 transitions. [2024-10-14 04:26:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:26:02,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:26:02,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:26:02,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:26:02,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:26:02,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:26:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash -748431206, now seen corresponding path program 1 times [2024-10-14 04:26:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:26:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874189544] [2024-10-14 04:26:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:26:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:26:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:26:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:02,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:26:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:26:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:02,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:26:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:26:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:26:02,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:26:02,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874189544] [2024-10-14 04:26:02,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874189544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:26:02,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:26:02,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:26:02,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692757356] [2024-10-14 04:26:02,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:26:02,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:26:02,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:26:02,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:26:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:26:02,522 INFO L87 Difference]: Start difference. First operand 3354 states and 5931 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:26:05,122 INFO L93 Difference]: Finished difference Result 6295 states and 10728 transitions. [2024-10-14 04:26:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:26:05,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:26:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:26:05,163 INFO L225 Difference]: With dead ends: 6295 [2024-10-14 04:26:05,164 INFO L226 Difference]: Without dead ends: 5076 [2024-10-14 04:26:05,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:26:05,171 INFO L432 NwaCegarLoop]: 4320 mSDtfsCounter, 5016 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5031 SdHoareTripleChecker+Valid, 21344 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:26:05,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5031 Valid, 21344 Invalid, 2633 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 04:26:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2024-10-14 04:26:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 4323. [2024-10-14 04:26:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4323 states, 4099 states have (on average 1.738716760185411) internal successors, (7127), 4110 states have internal predecessors, (7127), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-14 04:26:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 7480 transitions. [2024-10-14 04:26:05,435 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 7480 transitions. Word has length 122 [2024-10-14 04:26:05,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:26:05,435 INFO L471 AbstractCegarLoop]: Abstraction has 4323 states and 7480 transitions. [2024-10-14 04:26:05,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 7480 transitions. [2024-10-14 04:26:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:26:05,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:26:05,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:26:05,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:26:05,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:26:05,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:26:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash 282609692, now seen corresponding path program 1 times [2024-10-14 04:26:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:26:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939678972] [2024-10-14 04:26:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:26:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:26:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:05,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:26:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:05,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:26:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:05,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:26:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:26:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:05,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:26:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:26:05,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:26:05,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939678972] [2024-10-14 04:26:05,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939678972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:26:05,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:26:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:26:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936490186] [2024-10-14 04:26:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:26:05,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:26:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:26:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:26:05,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:26:05,682 INFO L87 Difference]: Start difference. First operand 4323 states and 7480 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:26:06,971 INFO L93 Difference]: Finished difference Result 7271 states and 12318 transitions. [2024-10-14 04:26:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:26:06,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:26:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:26:06,990 INFO L225 Difference]: With dead ends: 7271 [2024-10-14 04:26:06,991 INFO L226 Difference]: Without dead ends: 5083 [2024-10-14 04:26:06,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:26:06,999 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4738 mSDsluCounter, 16424 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 20576 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:26:07,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 20576 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 04:26:07,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2024-10-14 04:26:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4323. [2024-10-14 04:26:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4323 states, 4099 states have (on average 1.7365211027079777) internal successors, (7118), 4110 states have internal predecessors, (7118), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-14 04:26:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 7471 transitions. [2024-10-14 04:26:07,165 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 7471 transitions. Word has length 122 [2024-10-14 04:26:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:26:07,165 INFO L471 AbstractCegarLoop]: Abstraction has 4323 states and 7471 transitions. [2024-10-14 04:26:07,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 7471 transitions. [2024-10-14 04:26:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:26:07,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:26:07,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:26:07,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:26:07,169 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:26:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:26:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1623793574, now seen corresponding path program 1 times [2024-10-14 04:26:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:26:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391804887] [2024-10-14 04:26:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:26:07,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:26:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:26:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:26:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:07,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:26:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:07,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:26:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:07,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:26:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:26:07,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:26:07,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391804887] [2024-10-14 04:26:07,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391804887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:26:07,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:26:07,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:26:07,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148367102] [2024-10-14 04:26:07,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:26:07,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:26:07,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:26:07,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:26:07,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:26:07,362 INFO L87 Difference]: Start difference. First operand 4323 states and 7471 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:26:09,769 INFO L93 Difference]: Finished difference Result 9746 states and 16269 transitions. [2024-10-14 04:26:09,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:26:09,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:26:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:26:09,793 INFO L225 Difference]: With dead ends: 9746 [2024-10-14 04:26:09,793 INFO L226 Difference]: Without dead ends: 7558 [2024-10-14 04:26:09,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:26:09,803 INFO L432 NwaCegarLoop]: 4320 mSDtfsCounter, 5008 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5023 SdHoareTripleChecker+Valid, 21344 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:26:09,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5023 Valid, 21344 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:26:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2024-10-14 04:26:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 6271. [2024-10-14 04:26:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6271 states, 5855 states have (on average 1.690862510674637) internal successors, (9900), 5874 states have internal predecessors, (9900), 296 states have call successors, (296), 103 states have call predecessors, (296), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-14 04:26:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6271 states to 6271 states and 10587 transitions. [2024-10-14 04:26:10,087 INFO L78 Accepts]: Start accepts. Automaton has 6271 states and 10587 transitions. Word has length 122 [2024-10-14 04:26:10,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:26:10,087 INFO L471 AbstractCegarLoop]: Abstraction has 6271 states and 10587 transitions. [2024-10-14 04:26:10,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6271 states and 10587 transitions. [2024-10-14 04:26:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:26:10,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:26:10,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:26:10,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:26:10,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:26:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:26:10,095 INFO L85 PathProgramCache]: Analyzing trace with hash -22722468, now seen corresponding path program 1 times [2024-10-14 04:26:10,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:26:10,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979958298] [2024-10-14 04:26:10,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:26:10,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:26:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:26:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:10,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:26:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:26:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:26:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:10,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:26:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:26:10,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:26:10,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979958298] [2024-10-14 04:26:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979958298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:26:10,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:26:10,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:26:10,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37423892] [2024-10-14 04:26:10,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:26:10,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:26:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:26:10,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:26:10,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:26:10,297 INFO L87 Difference]: Start difference. First operand 6271 states and 10587 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:26:13,172 INFO L93 Difference]: Finished difference Result 18328 states and 30157 transitions. [2024-10-14 04:26:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:26:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:26:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:26:13,218 INFO L225 Difference]: With dead ends: 18328 [2024-10-14 04:26:13,218 INFO L226 Difference]: Without dead ends: 14192 [2024-10-14 04:26:13,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:26:13,235 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5301 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5325 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:26:13,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5325 Valid, 21337 Invalid, 2575 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:26:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14192 states. [2024-10-14 04:26:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14192 to 10148. [2024-10-14 04:26:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10148 states, 9364 states have (on average 1.6516445963263562) internal successors, (15466), 9399 states have internal predecessors, (15466), 552 states have call successors, (552), 199 states have call predecessors, (552), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-14 04:26:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10148 states to 10148 states and 16843 transitions. [2024-10-14 04:26:13,726 INFO L78 Accepts]: Start accepts. Automaton has 10148 states and 16843 transitions. Word has length 122 [2024-10-14 04:26:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:26:13,726 INFO L471 AbstractCegarLoop]: Abstraction has 10148 states and 16843 transitions. [2024-10-14 04:26:13,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 10148 states and 16843 transitions. [2024-10-14 04:26:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:26:13,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:26:13,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:26:13,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:26:13,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:26:13,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:26:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1079453670, now seen corresponding path program 1 times [2024-10-14 04:26:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:26:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462463489] [2024-10-14 04:26:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:26:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:26:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:26:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:13,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:26:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:13,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:26:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:13,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:26:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:26:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:26:13,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:26:13,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462463489] [2024-10-14 04:26:13,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462463489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:26:13,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:26:13,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:26:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189209558] [2024-10-14 04:26:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:26:13,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:26:13,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:26:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:26:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:26:13,924 INFO L87 Difference]: Start difference. First operand 10148 states and 16843 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:26:17,419 INFO L93 Difference]: Finished difference Result 33379 states and 54727 transitions. [2024-10-14 04:26:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:26:17,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:26:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:26:17,524 INFO L225 Difference]: With dead ends: 33379 [2024-10-14 04:26:17,524 INFO L226 Difference]: Without dead ends: 25366 [2024-10-14 04:26:17,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:26:17,568 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 5136 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5150 SdHoareTripleChecker+Valid, 20847 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:26:17,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5150 Valid, 20847 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2644 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:26:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25366 states. [2024-10-14 04:26:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25366 to 17581. [2024-10-14 04:26:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17581 states, 16077 states have (on average 1.620451576786714) internal successors, (26052), 16144 states have internal predecessors, (26052), 1048 states have call successors, (1048), 391 states have call predecessors, (1048), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-14 04:26:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17581 states to 17581 states and 28939 transitions. [2024-10-14 04:26:19,014 INFO L78 Accepts]: Start accepts. Automaton has 17581 states and 28939 transitions. Word has length 122 [2024-10-14 04:26:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:26:19,015 INFO L471 AbstractCegarLoop]: Abstraction has 17581 states and 28939 transitions. [2024-10-14 04:26:19,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17581 states and 28939 transitions. [2024-10-14 04:26:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:26:19,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:26:19,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:26:19,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:26:19,029 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:26:19,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:26:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash 271931548, now seen corresponding path program 1 times [2024-10-14 04:26:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:26:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747467750] [2024-10-14 04:26:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:26:19,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:26:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:19,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:26:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:26:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:19,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:26:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:26:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:19,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:26:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:26:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:26:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747467750] [2024-10-14 04:26:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747467750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:26:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:26:19,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:26:19,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549265212] [2024-10-14 04:26:19,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:26:19,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:26:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:26:19,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:26:19,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:26:19,214 INFO L87 Difference]: Start difference. First operand 17581 states and 28939 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:26:23,724 INFO L93 Difference]: Finished difference Result 62074 states and 101957 transitions. [2024-10-14 04:26:23,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:26:23,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:26:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:26:23,902 INFO L225 Difference]: With dead ends: 62074 [2024-10-14 04:26:23,902 INFO L226 Difference]: Without dead ends: 46628 [2024-10-14 04:26:23,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:26:23,951 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5235 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5259 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:26:23,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5259 Valid, 21337 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:26:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46628 states. [2024-10-14 04:26:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46628 to 32766. [2024-10-14 04:26:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32766 states, 29854 states have (on average 1.603202250954646) internal successors, (47862), 29985 states have internal predecessors, (47862), 2008 states have call successors, (2008), 775 states have call predecessors, (2008), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-14 04:26:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32766 states to 32766 states and 54191 transitions. [2024-10-14 04:26:26,374 INFO L78 Accepts]: Start accepts. Automaton has 32766 states and 54191 transitions. Word has length 122 [2024-10-14 04:26:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:26:26,374 INFO L471 AbstractCegarLoop]: Abstraction has 32766 states and 54191 transitions. [2024-10-14 04:26:26,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 32766 states and 54191 transitions. [2024-10-14 04:26:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:26:26,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:26:26,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:26:26,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:26:26,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:26:26,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:26:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1347043366, now seen corresponding path program 1 times [2024-10-14 04:26:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:26:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193940356] [2024-10-14 04:26:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:26:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:26:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:26:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:26:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:26:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:26:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:26:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:26:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:26:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193940356] [2024-10-14 04:26:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193940356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:26:26,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:26:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:26:26,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953760887] [2024-10-14 04:26:26,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:26:26,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:26:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:26:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:26:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:26:26,622 INFO L87 Difference]: Start difference. First operand 32766 states and 54191 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:26:33,724 INFO L93 Difference]: Finished difference Result 117735 states and 195799 transitions. [2024-10-14 04:26:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:26:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-14 04:26:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:26:34,085 INFO L225 Difference]: With dead ends: 117735 [2024-10-14 04:26:34,085 INFO L226 Difference]: Without dead ends: 87104 [2024-10-14 04:26:34,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:26:34,196 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5044 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5058 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:26:34,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5058 Valid, 21337 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2770 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:26:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87104 states. [2024-10-14 04:26:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87104 to 63264. [2024-10-14 04:26:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63264 states, 57600 states have (on average 1.5948958333333334) internal successors, (91866), 57859 states have internal predecessors, (91866), 3864 states have call successors, (3864), 1543 states have call predecessors, (3864), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-14 04:26:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63264 states to 63264 states and 106409 transitions. [2024-10-14 04:26:39,385 INFO L78 Accepts]: Start accepts. Automaton has 63264 states and 106409 transitions. Word has length 122 [2024-10-14 04:26:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:26:39,387 INFO L471 AbstractCegarLoop]: Abstraction has 63264 states and 106409 transitions. [2024-10-14 04:26:39,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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-14 04:26:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 63264 states and 106409 transitions. [2024-10-14 04:26:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:26:39,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:26:39,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:26:39,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:26:39,425 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:26:39,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:26:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1375543656, now seen corresponding path program 1 times [2024-10-14 04:26:39,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:26:39,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397149830] [2024-10-14 04:26:39,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:26:39,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:26:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:26:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:26:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:26:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:39,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:26:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:39,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:26:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:26:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:26:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:26:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397149830] [2024-10-14 04:26:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397149830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:26:39,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:26:39,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:26:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893340087] [2024-10-14 04:26:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:26:39,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:26:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:26:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:26:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:26:39,619 INFO L87 Difference]: Start difference. First operand 63264 states and 106409 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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)