./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.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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.07.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 ece5e10278ff4277201bc584c9d4f272bab8d3b56dec5e2dfa257f3717fce473 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:57:06,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:57:06,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:57:06,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:57:06,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:57:06,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:57:06,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:57:06,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:57:06,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:57:06,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:57:06,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:57:06,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:57:06,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:57:06,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:57:06,630 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:57:06,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:57:06,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:57:06,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:57:06,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:57:06,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:57:06,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:57:06,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:57:06,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:57:06,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:57:06,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:57:06,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:57:06,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:57:06,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:57:06,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:57:06,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:57:06,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:57:06,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:57:06,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:06,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:57:06,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:57:06,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:57:06,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:57:06,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:57:06,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:57:06,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:57:06,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:57:06,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:57:06,641 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 -> ece5e10278ff4277201bc584c9d4f272bab8d3b56dec5e2dfa257f3717fce473 [2024-10-12 20:57:06,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:57:06,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:57:06,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:57:06,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:57:06,951 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:57:06,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c [2024-10-12 20:57:08,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:57:09,026 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:57:09,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c [2024-10-12 20:57:09,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb91ed4e/eebc08d2c3284a89a274c0e6cef3d4a3/FLAG4c113f963 [2024-10-12 20:57:09,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb91ed4e/eebc08d2c3284a89a274c0e6cef3d4a3 [2024-10-12 20:57:09,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:57:09,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:57:09,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:09,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:57:09,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:57:09,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:09" (1/1) ... [2024-10-12 20:57:09,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d96a0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:09, skipping insertion in model container [2024-10-12 20:57:09,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:09" (1/1) ... [2024-10-12 20:57:09,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:57:10,982 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.07.cil-2.c[381679,381692] [2024-10-12 20:57:11,005 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.07.cil-2.c[383339,383352] [2024-10-12 20:57:11,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:11,212 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:57:12,045 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.07.cil-2.c[381679,381692] [2024-10-12 20:57:12,049 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.07.cil-2.c[383339,383352] [2024-10-12 20:57:12,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:12,132 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:57:12,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12 WrapperNode [2024-10-12 20:57:12,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:12,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:12,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:57:12,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:57:12,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:12,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:12,610 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12939 [2024-10-12 20:57:12,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:12,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:57:12,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:57:12,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:57:12,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:12,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:12,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:12,795 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-12 20:57:12,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:12,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:13,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:13,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:13,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:13,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:13,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:57:13,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:57:13,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:57:13,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:57:13,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (1/1) ... [2024-10-12 20:57:13,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:13,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:57:13,465 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-12 20:57:13,471 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-12 20:57:13,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:57:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:57:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:57:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:57:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:57:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:57:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:57:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 20:57:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 20:57:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:57:13,522 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:57:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:57:13,522 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:57:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:57:13,522 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:57:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:57:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:57:13,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:57:13,631 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:57:13,634 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:57:21,113 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2024-10-12 20:57:21,113 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:57:21,321 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:57:21,322 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-12 20:57:21,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:57:21 BoogieIcfgContainer [2024-10-12 20:57:21,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:57:21,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:57:21,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:57:21,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:57:21,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:57:09" (1/3) ... [2024-10-12 20:57:21,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e530c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:57:21, skipping insertion in model container [2024-10-12 20:57:21,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:12" (2/3) ... [2024-10-12 20:57:21,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e530c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:57:21, skipping insertion in model container [2024-10-12 20:57:21,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:57:21" (3/3) ... [2024-10-12 20:57:21,333 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.07.cil-2.c [2024-10-12 20:57:21,353 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:57:21,354 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:57:21,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:57:21,498 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;@4073a56a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:57:21,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:57:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 2364 states, 2331 states have (on average 1.8807378807378807) internal successors, (4384), 2336 states have internal predecessors, (4384), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 20:57:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:21,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:21,535 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] [2024-10-12 20:57:21,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:21,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -626584138, now seen corresponding path program 1 times [2024-10-12 20:57:21,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525796733] [2024-10-12 20:57:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:21,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:21,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:22,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:22,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:22,174 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-12 20:57:22,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525796733] [2024-10-12 20:57:22,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525796733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:22,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:22,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:57:22,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221683258] [2024-10-12 20:57:22,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:22,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:57:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:57:22,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:57:22,226 INFO L87 Difference]: Start difference. First operand has 2364 states, 2331 states have (on average 1.8807378807378807) internal successors, (4384), 2336 states have internal predecessors, (4384), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-12 20:57:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:23,705 INFO L93 Difference]: Finished difference Result 4797 states and 8982 transitions. [2024-10-12 20:57:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:57:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:23,739 INFO L225 Difference]: With dead ends: 4797 [2024-10-12 20:57:23,740 INFO L226 Difference]: Without dead ends: 2439 [2024-10-12 20:57:23,748 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-12 20:57:23,751 INFO L432 NwaCegarLoop]: 4173 mSDtfsCounter, 632 mSDsluCounter, 12112 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 16285 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:23,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 16285 Invalid, 731 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:57:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2024-10-12 20:57:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2359. [2024-10-12 20:57:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2328 states have (on average 1.8445017182130585) internal successors, (4294), 2331 states have internal predecessors, (4294), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-12 20:57:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4338 transitions. [2024-10-12 20:57:23,918 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4338 transitions. Word has length 112 [2024-10-12 20:57:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:23,918 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 4338 transitions. [2024-10-12 20:57:23,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-12 20:57:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4338 transitions. [2024-10-12 20:57:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:23,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:23,925 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] [2024-10-12 20:57:23,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:57:23,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:23,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1657625036, now seen corresponding path program 1 times [2024-10-12 20:57:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:23,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625463387] [2024-10-12 20:57:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:24,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:24,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:24,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:24,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:24,305 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-12 20:57:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:24,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625463387] [2024-10-12 20:57:24,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625463387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:24,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:24,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:57:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774491060] [2024-10-12 20:57:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:24,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:57:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:24,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:57:24,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:57:24,313 INFO L87 Difference]: Start difference. First operand 2359 states and 4338 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-12 20:57:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:26,365 INFO L93 Difference]: Finished difference Result 2978 states and 5358 transitions. [2024-10-12 20:57:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:57:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:26,380 INFO L225 Difference]: With dead ends: 2978 [2024-10-12 20:57:26,381 INFO L226 Difference]: Without dead ends: 2753 [2024-10-12 20:57:26,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:57:26,385 INFO L432 NwaCegarLoop]: 4148 mSDtfsCounter, 4905 mSDsluCounter, 12430 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 16578 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:26,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 16578 Invalid, 1554 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:57:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2024-10-12 20:57:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2592. [2024-10-12 20:57:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2538 states have (on average 1.8270291568163908) internal successors, (4637), 2542 states have internal predecessors, (4637), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-12 20:57:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 4716 transitions. [2024-10-12 20:57:26,471 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 4716 transitions. Word has length 112 [2024-10-12 20:57:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:26,472 INFO L471 AbstractCegarLoop]: Abstraction has 2592 states and 4716 transitions. [2024-10-12 20:57:26,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-12 20:57:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 4716 transitions. [2024-10-12 20:57:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:26,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:26,475 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] [2024-10-12 20:57:26,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:57:26,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:26,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash -663372240, now seen corresponding path program 1 times [2024-10-12 20:57:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925292031] [2024-10-12 20:57:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:26,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:26,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:26,736 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-12 20:57:26,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:26,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925292031] [2024-10-12 20:57:26,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925292031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:26,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:26,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610365350] [2024-10-12 20:57:26,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:26,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:26,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:26,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:26,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:26,744 INFO L87 Difference]: Start difference. First operand 2592 states and 4716 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:29,234 INFO L93 Difference]: Finished difference Result 3533 states and 6264 transitions. [2024-10-12 20:57:29,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:29,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:29,253 INFO L225 Difference]: With dead ends: 3533 [2024-10-12 20:57:29,253 INFO L226 Difference]: Without dead ends: 3075 [2024-10-12 20:57:29,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:29,258 INFO L432 NwaCegarLoop]: 4292 mSDtfsCounter, 4918 mSDsluCounter, 16919 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4932 SdHoareTripleChecker+Valid, 21211 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:29,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4932 Valid, 21211 Invalid, 2443 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 20:57:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2024-10-12 20:57:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2808. [2024-10-12 20:57:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2808 states, 2731 states have (on average 1.8110582204320762) internal successors, (4946), 2736 states have internal predecessors, (4946), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-12 20:57:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 5059 transitions. [2024-10-12 20:57:29,365 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 5059 transitions. Word has length 112 [2024-10-12 20:57:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:29,367 INFO L471 AbstractCegarLoop]: Abstraction has 2808 states and 5059 transitions. [2024-10-12 20:57:29,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 5059 transitions. [2024-10-12 20:57:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:29,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:29,371 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] [2024-10-12 20:57:29,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:57:29,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash 688012978, now seen corresponding path program 1 times [2024-10-12 20:57:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806675448] [2024-10-12 20:57:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:29,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:29,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:29,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:29,633 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-12 20:57:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806675448] [2024-10-12 20:57:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806675448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:29,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:29,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296308687] [2024-10-12 20:57:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:29,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:29,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:29,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:29,636 INFO L87 Difference]: Start difference. First operand 2808 states and 5059 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:32,057 INFO L93 Difference]: Finished difference Result 4346 states and 7585 transitions. [2024-10-12 20:57:32,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:32,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:32,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:32,077 INFO L225 Difference]: With dead ends: 4346 [2024-10-12 20:57:32,077 INFO L226 Difference]: Without dead ends: 3672 [2024-10-12 20:57:32,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:32,083 INFO L432 NwaCegarLoop]: 4290 mSDtfsCounter, 4916 mSDsluCounter, 16919 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4930 SdHoareTripleChecker+Valid, 21209 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:32,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4930 Valid, 21209 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 20:57:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2024-10-12 20:57:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3241. [2024-10-12 20:57:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.784797947402181) internal successors, (5565), 3125 states have internal predecessors, (5565), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 20:57:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5750 transitions. [2024-10-12 20:57:32,218 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5750 transitions. Word has length 112 [2024-10-12 20:57:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:32,219 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5750 transitions. [2024-10-12 20:57:32,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5750 transitions. [2024-10-12 20:57:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:32,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:32,221 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] [2024-10-12 20:57:32,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:57:32,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:32,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash -930961936, now seen corresponding path program 1 times [2024-10-12 20:57:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:32,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380265753] [2024-10-12 20:57:32,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:32,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:32,438 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-12 20:57:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380265753] [2024-10-12 20:57:32,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380265753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:32,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:32,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:32,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497795044] [2024-10-12 20:57:32,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:32,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:32,445 INFO L87 Difference]: Start difference. First operand 3241 states and 5750 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:33,539 INFO L93 Difference]: Finished difference Result 4767 states and 8267 transitions. [2024-10-12 20:57:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:33,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:33,555 INFO L225 Difference]: With dead ends: 4767 [2024-10-12 20:57:33,555 INFO L226 Difference]: Without dead ends: 3660 [2024-10-12 20:57:33,561 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-12 20:57:33,562 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4757 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 16431 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:33,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 16431 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:57:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2024-10-12 20:57:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3241. [2024-10-12 20:57:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.7831943553559975) internal successors, (5560), 3125 states have internal predecessors, (5560), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 20:57:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5745 transitions. [2024-10-12 20:57:33,683 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5745 transitions. Word has length 112 [2024-10-12 20:57:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:33,683 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5745 transitions. [2024-10-12 20:57:33,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5745 transitions. [2024-10-12 20:57:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:33,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:33,686 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] [2024-10-12 20:57:33,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:57:33,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:33,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:33,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1814470926, now seen corresponding path program 1 times [2024-10-12 20:57:33,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:33,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397548296] [2024-10-12 20:57:33,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:33,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,864 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-12 20:57:33,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:33,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397548296] [2024-10-12 20:57:33,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397548296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:33,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:33,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970907586] [2024-10-12 20:57:33,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:33,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:33,868 INFO L87 Difference]: Start difference. First operand 3241 states and 5745 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:35,142 INFO L93 Difference]: Finished difference Result 4761 states and 8241 transitions. [2024-10-12 20:57:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:35,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:35,160 INFO L225 Difference]: With dead ends: 4761 [2024-10-12 20:57:35,160 INFO L226 Difference]: Without dead ends: 3654 [2024-10-12 20:57:35,166 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-12 20:57:35,168 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4657 mSDsluCounter, 16370 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 20505 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:35,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 20505 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:57:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-10-12 20:57:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3241. [2024-10-12 20:57:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.781590763309814) internal successors, (5555), 3125 states have internal predecessors, (5555), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 20:57:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5740 transitions. [2024-10-12 20:57:35,341 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5740 transitions. Word has length 112 [2024-10-12 20:57:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:35,342 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5740 transitions. [2024-10-12 20:57:35,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5740 transitions. [2024-10-12 20:57:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:35,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:35,345 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] [2024-10-12 20:57:35,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:57:35,345 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:35,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1842971216, now seen corresponding path program 1 times [2024-10-12 20:57:35,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:35,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589263110] [2024-10-12 20:57:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:35,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:35,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:35,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:35,561 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-12 20:57:35,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:35,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589263110] [2024-10-12 20:57:35,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589263110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:35,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:35,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:35,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585717624] [2024-10-12 20:57:35,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:35,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:35,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:35,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:35,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:35,564 INFO L87 Difference]: Start difference. First operand 3241 states and 5740 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:36,669 INFO L93 Difference]: Finished difference Result 4754 states and 8213 transitions. [2024-10-12 20:57:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:36,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:36,686 INFO L225 Difference]: With dead ends: 4754 [2024-10-12 20:57:36,686 INFO L226 Difference]: Without dead ends: 3647 [2024-10-12 20:57:36,694 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-12 20:57:36,696 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4759 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4774 SdHoareTripleChecker+Valid, 16431 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:36,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4774 Valid, 16431 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:57:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3647 states. [2024-10-12 20:57:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3647 to 3241. [2024-10-12 20:57:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.7799871712636306) internal successors, (5550), 3125 states have internal predecessors, (5550), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 20:57:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5735 transitions. [2024-10-12 20:57:36,876 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5735 transitions. Word has length 112 [2024-10-12 20:57:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:36,878 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5735 transitions. [2024-10-12 20:57:36,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5735 transitions. [2024-10-12 20:57:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:36,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:36,881 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] [2024-10-12 20:57:36,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:57:36,881 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:36,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:36,882 INFO L85 PathProgramCache]: Analyzing trace with hash 511414066, now seen corresponding path program 1 times [2024-10-12 20:57:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:36,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202456402] [2024-10-12 20:57:36,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:36,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,123 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-12 20:57:37,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:37,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202456402] [2024-10-12 20:57:37,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202456402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:37,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:37,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:37,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403113667] [2024-10-12 20:57:37,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:37,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:37,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:37,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:37,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:37,134 INFO L87 Difference]: Start difference. First operand 3241 states and 5735 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:38,220 INFO L93 Difference]: Finished difference Result 4742 states and 8175 transitions. [2024-10-12 20:57:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:38,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:38,239 INFO L225 Difference]: With dead ends: 4742 [2024-10-12 20:57:38,239 INFO L226 Difference]: Without dead ends: 3635 [2024-10-12 20:57:38,244 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-12 20:57:38,245 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4755 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4770 SdHoareTripleChecker+Valid, 16431 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:38,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4770 Valid, 16431 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:57:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2024-10-12 20:57:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3241. [2024-10-12 20:57:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.7783835792174472) internal successors, (5545), 3125 states have internal predecessors, (5545), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 20:57:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5730 transitions. [2024-10-12 20:57:38,361 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5730 transitions. Word has length 112 [2024-10-12 20:57:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:38,361 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5730 transitions. [2024-10-12 20:57:38,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5730 transitions. [2024-10-12 20:57:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:38,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:38,364 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] [2024-10-12 20:57:38,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:57:38,365 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:38,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash -259319500, now seen corresponding path program 1 times [2024-10-12 20:57:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374305759] [2024-10-12 20:57:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:38,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:38,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:38,565 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-12 20:57:38,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:38,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374305759] [2024-10-12 20:57:38,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374305759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:38,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:38,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20629356] [2024-10-12 20:57:38,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:38,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:38,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:38,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:38,569 INFO L87 Difference]: Start difference. First operand 3241 states and 5730 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:40,803 INFO L93 Difference]: Finished difference Result 6242 states and 10548 transitions. [2024-10-12 20:57:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:57:40,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:40,819 INFO L225 Difference]: With dead ends: 6242 [2024-10-12 20:57:40,819 INFO L226 Difference]: Without dead ends: 5135 [2024-10-12 20:57:40,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:57:40,825 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5146 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5168 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:40,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5168 Valid, 21202 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:57:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2024-10-12 20:57:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 4122. [2024-10-12 20:57:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4122 states, 3911 states have (on average 1.7371516236256712) internal successors, (6794), 3922 states have internal predecessors, (6794), 147 states have call successors, (147), 55 states have call predecessors, (147), 62 states have return successors, (180), 152 states have call predecessors, (180), 145 states have call successors, (180) [2024-10-12 20:57:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 7121 transitions. [2024-10-12 20:57:40,996 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 7121 transitions. Word has length 112 [2024-10-12 20:57:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:40,997 INFO L471 AbstractCegarLoop]: Abstraction has 4122 states and 7121 transitions. [2024-10-12 20:57:40,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 7121 transitions. [2024-10-12 20:57:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:41,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:41,001 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] [2024-10-12 20:57:41,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:57:41,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1254013198, now seen corresponding path program 1 times [2024-10-12 20:57:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17108735] [2024-10-12 20:57:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,184 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-12 20:57:41,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:41,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17108735] [2024-10-12 20:57:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17108735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:41,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:41,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:41,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591766069] [2024-10-12 20:57:41,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:41,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:41,187 INFO L87 Difference]: Start difference. First operand 4122 states and 7121 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:43,687 INFO L93 Difference]: Finished difference Result 9619 states and 15939 transitions. [2024-10-12 20:57:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:57:43,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:43,715 INFO L225 Difference]: With dead ends: 9619 [2024-10-12 20:57:43,716 INFO L226 Difference]: Without dead ends: 7631 [2024-10-12 20:57:43,726 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-12 20:57:43,727 INFO L432 NwaCegarLoop]: 4287 mSDtfsCounter, 4941 mSDsluCounter, 16911 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4954 SdHoareTripleChecker+Valid, 21198 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:43,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4954 Valid, 21198 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 20:57:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7631 states. [2024-10-12 20:57:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7631 to 5793. [2024-10-12 20:57:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5793 states, 5410 states have (on average 1.688354898336414) internal successors, (9134), 5429 states have internal predecessors, (9134), 263 states have call successors, (263), 103 states have call predecessors, (263), 118 states have return successors, (358), 276 states have call predecessors, (358), 261 states have call successors, (358) [2024-10-12 20:57:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5793 states to 5793 states and 9755 transitions. [2024-10-12 20:57:44,189 INFO L78 Accepts]: Start accepts. Automaton has 5793 states and 9755 transitions. Word has length 112 [2024-10-12 20:57:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:44,189 INFO L471 AbstractCegarLoop]: Abstraction has 5793 states and 9755 transitions. [2024-10-12 20:57:44,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5793 states and 9755 transitions. [2024-10-12 20:57:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:44,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:44,194 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] [2024-10-12 20:57:44,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:57:44,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:44,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1840289420, now seen corresponding path program 1 times [2024-10-12 20:57:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70418861] [2024-10-12 20:57:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:44,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:44,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:44,392 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-12 20:57:44,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70418861] [2024-10-12 20:57:44,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70418861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:44,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:44,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:44,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403909594] [2024-10-12 20:57:44,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:44,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:44,396 INFO L87 Difference]: Start difference. First operand 5793 states and 9755 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:46,896 INFO L93 Difference]: Finished difference Result 16012 states and 26135 transitions. [2024-10-12 20:57:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:57:46,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:46,940 INFO L225 Difference]: With dead ends: 16012 [2024-10-12 20:57:46,941 INFO L226 Difference]: Without dead ends: 12353 [2024-10-12 20:57:46,957 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-12 20:57:46,958 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5074 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5096 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:46,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5096 Valid, 21202 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:57:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12353 states. [2024-10-12 20:57:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12353 to 9214. [2024-10-12 20:57:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9214 states, 8495 states have (on average 1.6447321954090641) internal successors, (13972), 8530 states have internal predecessors, (13972), 487 states have call successors, (487), 199 states have call predecessors, (487), 230 states have return successors, (760), 516 states have call predecessors, (760), 485 states have call successors, (760) [2024-10-12 20:57:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 15219 transitions. [2024-10-12 20:57:47,616 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 15219 transitions. Word has length 112 [2024-10-12 20:57:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:47,617 INFO L471 AbstractCegarLoop]: Abstraction has 9214 states and 15219 transitions. [2024-10-12 20:57:47,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 15219 transitions. [2024-10-12 20:57:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:47,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:47,624 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] [2024-10-12 20:57:47,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:57:47,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:47,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash 496103090, now seen corresponding path program 1 times [2024-10-12 20:57:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:47,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778107066] [2024-10-12 20:57:47,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:47,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:47,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:47,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:47,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:47,808 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-12 20:57:47,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:47,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778107066] [2024-10-12 20:57:47,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778107066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:47,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:47,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:47,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236591366] [2024-10-12 20:57:47,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:47,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:47,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:47,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:47,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:47,811 INFO L87 Difference]: Start difference. First operand 9214 states and 15219 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:51,051 INFO L93 Difference]: Finished difference Result 28783 states and 46745 transitions. [2024-10-12 20:57:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:57:51,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:51,147 INFO L225 Difference]: With dead ends: 28783 [2024-10-12 20:57:51,147 INFO L226 Difference]: Without dead ends: 21703 [2024-10-12 20:57:51,180 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-12 20:57:51,181 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5038 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5060 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:51,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5060 Valid, 21202 Invalid, 2265 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:57:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21703 states. [2024-10-12 20:57:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21703 to 16055. [2024-10-12 20:57:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16055 states, 14680 states have (on average 1.6129427792915532) internal successors, (23678), 14747 states have internal predecessors, (23678), 919 states have call successors, (919), 391 states have call predecessors, (919), 454 states have return successors, (1710), 980 states have call predecessors, (1710), 917 states have call successors, (1710) [2024-10-12 20:57:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16055 states to 16055 states and 26307 transitions. [2024-10-12 20:57:52,237 INFO L78 Accepts]: Start accepts. Automaton has 16055 states and 26307 transitions. Word has length 112 [2024-10-12 20:57:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:52,238 INFO L471 AbstractCegarLoop]: Abstraction has 16055 states and 26307 transitions. [2024-10-12 20:57:52,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 16055 states and 26307 transitions. [2024-10-12 20:57:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:52,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:52,248 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] [2024-10-12 20:57:52,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:57:52,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:52,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:52,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1922381388, now seen corresponding path program 1 times [2024-10-12 20:57:52,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:52,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474090019] [2024-10-12 20:57:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:52,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,417 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-12 20:57:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474090019] [2024-10-12 20:57:52,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474090019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:52,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:52,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775768667] [2024-10-12 20:57:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:52,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:52,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:52,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:52,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:52,420 INFO L87 Difference]: Start difference. First operand 16055 states and 26307 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:56,574 INFO L93 Difference]: Finished difference Result 53846 states and 87783 transitions. [2024-10-12 20:57:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:57:56,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:57:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:56,731 INFO L225 Difference]: With dead ends: 53846 [2024-10-12 20:57:56,731 INFO L226 Difference]: Without dead ends: 39925 [2024-10-12 20:57:56,781 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-12 20:57:56,782 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 4912 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4925 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:56,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4925 Valid, 21202 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:57:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39925 states. [2024-10-12 20:57:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39925 to 29736. [2024-10-12 20:57:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29736 states, 27081 states have (on average 1.5934418965326242) internal successors, (43152), 27212 states have internal predecessors, (43152), 1751 states have call successors, (1751), 775 states have call predecessors, (1751), 902 states have return successors, (4064), 1876 states have call predecessors, (4064), 1749 states have call successors, (4064) [2024-10-12 20:57:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29736 states to 29736 states and 48967 transitions. [2024-10-12 20:57:58,857 INFO L78 Accepts]: Start accepts. Automaton has 29736 states and 48967 transitions. Word has length 112 [2024-10-12 20:57:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:58,857 INFO L471 AbstractCegarLoop]: Abstraction has 29736 states and 48967 transitions. [2024-10-12 20:57:58,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:57:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 29736 states and 48967 transitions. [2024-10-12 20:57:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:57:58,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:58,879 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] [2024-10-12 20:57:58,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:57:58,880 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:58,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash 493454962, now seen corresponding path program 1 times [2024-10-12 20:57:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021408111] [2024-10-12 20:57:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:58,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:57:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:57:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:57:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:57:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,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-12 20:57:59,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021408111] [2024-10-12 20:57:59,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021408111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:59,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:59,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:59,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383347457] [2024-10-12 20:57:59,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:59,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:59,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:59,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:59,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:59,039 INFO L87 Difference]: Start difference. First operand 29736 states and 48967 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:58:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:05,068 INFO L93 Difference]: Finished difference Result 103013 states and 170141 transitions. [2024-10-12 20:58:05,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:05,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-12 20:58:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:05,410 INFO L225 Difference]: With dead ends: 103013 [2024-10-12 20:58:05,410 INFO L226 Difference]: Without dead ends: 75411 [2024-10-12 20:58:05,507 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-12 20:58:05,507 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 4972 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4994 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:05,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4994 Valid, 21202 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:58:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75411 states. [2024-10-12 20:58:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75411 to 57097. [2024-10-12 20:58:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57097 states, 51946 states have (on average 1.58291302506449) internal successors, (82226), 52205 states have internal predecessors, (82226), 3351 states have call successors, (3351), 1543 states have call predecessors, (3351), 1798 states have return successors, (10166), 3604 states have call predecessors, (10166), 3349 states have call successors, (10166) [2024-10-12 20:58:09,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57097 states to 57097 states and 95743 transitions. [2024-10-12 20:58:09,852 INFO L78 Accepts]: Start accepts. Automaton has 57097 states and 95743 transitions. Word has length 112 [2024-10-12 20:58:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:09,854 INFO L471 AbstractCegarLoop]: Abstraction has 57097 states and 95743 transitions. [2024-10-12 20:58:09,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 20:58:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 57097 states and 95743 transitions. [2024-10-12 20:58:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:58:09,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:09,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] [2024-10-12 20:58:09,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:58:09,900 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:09,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1818311156, now seen corresponding path program 1 times [2024-10-12 20:58:09,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:09,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541141021] [2024-10-12 20:58:09,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:09,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:58:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:58:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:58:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:58:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:10,342 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-12 20:58:10,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541141021] [2024-10-12 20:58:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541141021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596802838] [2024-10-12 20:58:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:10,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:10,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:10,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:10,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:10,350 INFO L87 Difference]: Start difference. First operand 57097 states and 95743 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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)