./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/pc_sfifo_1.cil-2+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e8ee20bd48f38d06d172550f7b4afad7a85599a8fd397bba890e4eeccd52db93 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:01:15,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:01:15,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:01:15,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:01:15,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:01:15,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:01:15,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:01:15,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:01:15,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:01:15,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:01:15,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:01:15,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:01:15,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:01:15,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:01:15,390 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:01:15,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:01:15,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:01:15,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:01:15,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:01:15,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:01:15,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:01:15,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:01:15,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:01:15,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:01:15,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:01:15,393 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:01:15,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:01:15,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:01:15,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:01:15,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:01:15,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:01:15,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:01:15,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:01:15,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:01:15,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:01:15,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:01:15,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:01:15,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:01:15,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:01:15,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:01:15,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:01:15,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:01:15,399 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e8ee20bd48f38d06d172550f7b4afad7a85599a8fd397bba890e4eeccd52db93 [2024-10-11 05:01:15,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:01:15,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:01:15,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:01:15,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:01:15,697 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:01:15,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c [2024-10-11 05:01:17,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:01:17,482 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:01:17,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c [2024-10-11 05:01:17,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/02c89c54e/27e43b2629de4a71962619aea63ae566/FLAG893710151 [2024-10-11 05:01:17,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/02c89c54e/27e43b2629de4a71962619aea63ae566 [2024-10-11 05:01:17,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:01:17,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:01:17,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:01:17,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:01:17,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:01:17,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:01:17" (1/1) ... [2024-10-11 05:01:17,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2e901b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:17, skipping insertion in model container [2024-10-11 05:01:17,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:01:17" (1/1) ... [2024-10-11 05:01:17,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:01:17,764 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/pc_sfifo_1.cil-2+token_ring.08.cil-2.c[913,926] [2024-10-11 05:01:17,826 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/pc_sfifo_1.cil-2+token_ring.08.cil-2.c[5977,5990] [2024-10-11 05:01:17,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:01:17,934 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:01:17,946 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/pc_sfifo_1.cil-2+token_ring.08.cil-2.c[913,926] [2024-10-11 05:01:17,972 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/pc_sfifo_1.cil-2+token_ring.08.cil-2.c[5977,5990] [2024-10-11 05:01:18,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:01:18,065 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:01:18,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18 WrapperNode [2024-10-11 05:01:18,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:01:18,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:01:18,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:01:18,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:01:18,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,148 INFO L138 Inliner]: procedures = 64, calls = 73, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 849 [2024-10-11 05:01:18,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:01:18,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:01:18,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:01:18,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:01:18,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,189 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:01:18,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:01:18,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:01:18,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:01:18,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:01:18,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (1/1) ... [2024-10-11 05:01:18,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:01:18,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:18,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:01:18,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:01:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:01:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:01:18,328 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:01:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-11 05:01:18,329 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-11 05:01:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:01:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:01:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:01:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:01:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:01:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:01:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:01:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:01:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:01:18,331 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:01:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:01:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:01:18,332 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:01:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:01:18,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:01:18,333 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:01:18,333 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:01:18,333 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:01:18,333 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:01:18,470 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:01:18,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:01:19,415 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-11 05:01:19,415 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:01:19,513 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:01:19,514 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 05:01:19,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:01:19 BoogieIcfgContainer [2024-10-11 05:01:19,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:01:19,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:01:19,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:01:19,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:01:19,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:01:17" (1/3) ... [2024-10-11 05:01:19,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179e9739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:01:19, skipping insertion in model container [2024-10-11 05:01:19,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:01:18" (2/3) ... [2024-10-11 05:01:19,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179e9739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:01:19, skipping insertion in model container [2024-10-11 05:01:19,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:01:19" (3/3) ... [2024-10-11 05:01:19,528 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.08.cil-2.c [2024-10-11 05:01:19,545 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:01:19,546 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:01:19,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:01:19,634 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;@1da8c0c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:01:19,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:01:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 327 states, 284 states have (on average 1.7147887323943662) internal successors, (487), 291 states have internal predecessors, (487), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 05:01:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 05:01:19,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:19,652 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] [2024-10-11 05:01:19,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:19,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash 891848926, now seen corresponding path program 1 times [2024-10-11 05:01:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:19,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042700662] [2024-10-11 05:01:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:19,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042700662] [2024-10-11 05:01:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042700662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:19,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:19,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887042275] [2024-10-11 05:01:19,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:19,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:20,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:20,020 INFO L87 Difference]: Start difference. First operand has 327 states, 284 states have (on average 1.7147887323943662) internal successors, (487), 291 states have internal predecessors, (487), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 05:01:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:20,805 INFO L93 Difference]: Finished difference Result 643 states and 1072 transitions. [2024-10-11 05:01:20,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:20,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-11 05:01:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:20,827 INFO L225 Difference]: With dead ends: 643 [2024-10-11 05:01:20,828 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 05:01:20,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:20,842 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 287 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:20,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 718 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:01:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 05:01:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 321. [2024-10-11 05:01:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 281 states have (on average 1.597864768683274) internal successors, (449), 285 states have internal predecessors, (449), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 05:01:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 505 transitions. [2024-10-11 05:01:20,931 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 505 transitions. Word has length 37 [2024-10-11 05:01:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:20,932 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 505 transitions. [2024-10-11 05:01:20,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 05:01:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 505 transitions. [2024-10-11 05:01:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 05:01:20,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:20,936 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] [2024-10-11 05:01:20,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:01:20,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:20,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:20,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1159135072, now seen corresponding path program 1 times [2024-10-11 05:01:20,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621482406] [2024-10-11 05:01:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:21,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:21,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:21,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621482406] [2024-10-11 05:01:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621482406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:21,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:21,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760529502] [2024-10-11 05:01:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:21,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:21,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:21,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:21,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:21,085 INFO L87 Difference]: Start difference. First operand 321 states and 505 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:21,582 INFO L93 Difference]: Finished difference Result 440 states and 677 transitions. [2024-10-11 05:01:21,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:21,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-11 05:01:21,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:21,592 INFO L225 Difference]: With dead ends: 440 [2024-10-11 05:01:21,592 INFO L226 Difference]: Without dead ends: 384 [2024-10-11 05:01:21,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:21,594 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 665 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:21,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 578 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:01:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-11 05:01:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 378. [2024-10-11 05:01:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 331 states have (on average 1.5649546827794563) internal successors, (518), 336 states have internal predecessors, (518), 34 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (36), 30 states have call predecessors, (36), 30 states have call successors, (36) [2024-10-11 05:01:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 588 transitions. [2024-10-11 05:01:21,644 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 588 transitions. Word has length 37 [2024-10-11 05:01:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:21,644 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 588 transitions. [2024-10-11 05:01:21,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 588 transitions. [2024-10-11 05:01:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 05:01:21,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:21,649 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] [2024-10-11 05:01:21,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:01:21,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:21,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1260942925, now seen corresponding path program 1 times [2024-10-11 05:01:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:21,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990263528] [2024-10-11 05:01:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:21,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 05:01:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:21,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990263528] [2024-10-11 05:01:21,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990263528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:21,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:21,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:21,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759424638] [2024-10-11 05:01:21,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:21,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:21,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:21,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:21,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:21,755 INFO L87 Difference]: Start difference. First operand 378 states and 588 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:22,206 INFO L93 Difference]: Finished difference Result 612 states and 932 transitions. [2024-10-11 05:01:22,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:22,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-11 05:01:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:22,211 INFO L225 Difference]: With dead ends: 612 [2024-10-11 05:01:22,212 INFO L226 Difference]: Without dead ends: 501 [2024-10-11 05:01:22,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:22,215 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 683 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:22,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 580 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:01:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-11 05:01:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 478. [2024-10-11 05:01:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 418 states have (on average 1.5215311004784688) internal successors, (636), 424 states have internal predecessors, (636), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (50), 38 states have call predecessors, (50), 38 states have call successors, (50) [2024-10-11 05:01:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 728 transitions. [2024-10-11 05:01:22,261 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 728 transitions. Word has length 38 [2024-10-11 05:01:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:22,262 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 728 transitions. [2024-10-11 05:01:22,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 728 transitions. [2024-10-11 05:01:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 05:01:22,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:22,265 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] [2024-10-11 05:01:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:01:22,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -143652495, now seen corresponding path program 1 times [2024-10-11 05:01:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945133905] [2024-10-11 05:01:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:01:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:22,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:22,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945133905] [2024-10-11 05:01:22,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945133905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:22,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:22,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552081253] [2024-10-11 05:01:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:22,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:22,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:22,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:22,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:22,368 INFO L87 Difference]: Start difference. First operand 478 states and 728 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:22,869 INFO L93 Difference]: Finished difference Result 898 states and 1309 transitions. [2024-10-11 05:01:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:22,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-11 05:01:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:22,876 INFO L225 Difference]: With dead ends: 898 [2024-10-11 05:01:22,877 INFO L226 Difference]: Without dead ends: 687 [2024-10-11 05:01:22,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:22,881 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 270 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:22,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 813 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:01:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-11 05:01:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 583. [2024-10-11 05:01:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 511 states have (on average 1.4970645792563602) internal successors, (765), 519 states have internal predecessors, (765), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (56), 42 states have call predecessors, (56), 44 states have call successors, (56) [2024-10-11 05:01:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 869 transitions. [2024-10-11 05:01:22,925 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 869 transitions. Word has length 39 [2024-10-11 05:01:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:22,925 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 869 transitions. [2024-10-11 05:01:22,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:01:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 869 transitions. [2024-10-11 05:01:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 05:01:22,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:22,928 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:22,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:01:22,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:22,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:22,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1398437299, now seen corresponding path program 1 times [2024-10-11 05:01:22,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:22,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388204065] [2024-10-11 05:01:22,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:22,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 05:01:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:01:23,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:23,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388204065] [2024-10-11 05:01:23,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388204065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:23,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:23,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:23,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142915321] [2024-10-11 05:01:23,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:23,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:23,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:23,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:23,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:23,050 INFO L87 Difference]: Start difference. First operand 583 states and 869 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:01:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:23,559 INFO L93 Difference]: Finished difference Result 888 states and 1291 transitions. [2024-10-11 05:01:23,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:23,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-11 05:01:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:23,565 INFO L225 Difference]: With dead ends: 888 [2024-10-11 05:01:23,568 INFO L226 Difference]: Without dead ends: 677 [2024-10-11 05:01:23,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:23,570 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 255 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:23,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 858 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:01:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-10-11 05:01:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 643. [2024-10-11 05:01:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 562 states have (on average 1.4697508896797153) internal successors, (826), 571 states have internal predecessors, (826), 53 states have call successors, (53), 25 states have call predecessors, (53), 26 states have return successors, (65), 47 states have call predecessors, (65), 49 states have call successors, (65) [2024-10-11 05:01:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 944 transitions. [2024-10-11 05:01:23,630 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 944 transitions. Word has length 54 [2024-10-11 05:01:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:23,630 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 944 transitions. [2024-10-11 05:01:23,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:01:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 944 transitions. [2024-10-11 05:01:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:01:23,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:23,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:23,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:01:23,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:23,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash 332942367, now seen corresponding path program 1 times [2024-10-11 05:01:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:23,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192849533] [2024-10-11 05:01:23,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:01:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:01:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:01:23,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:23,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192849533] [2024-10-11 05:01:23,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192849533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:23,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:23,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:23,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892529150] [2024-10-11 05:01:23,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:23,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:23,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:23,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:23,709 INFO L87 Difference]: Start difference. First operand 643 states and 944 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:24,127 INFO L93 Difference]: Finished difference Result 1132 states and 1604 transitions. [2024-10-11 05:01:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:24,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-11 05:01:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:24,133 INFO L225 Difference]: With dead ends: 1132 [2024-10-11 05:01:24,134 INFO L226 Difference]: Without dead ends: 797 [2024-10-11 05:01:24,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:24,138 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 669 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:24,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 592 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:01:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-11 05:01:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 748. [2024-10-11 05:01:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 654 states have (on average 1.4357798165137614) internal successors, (939), 664 states have internal predecessors, (939), 60 states have call successors, (60), 30 states have call predecessors, (60), 32 states have return successors, (76), 54 states have call predecessors, (76), 56 states have call successors, (76) [2024-10-11 05:01:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1075 transitions. [2024-10-11 05:01:24,186 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1075 transitions. Word has length 59 [2024-10-11 05:01:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:24,187 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1075 transitions. [2024-10-11 05:01:24,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1075 transitions. [2024-10-11 05:01:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:01:24,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:24,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:24,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:01:24,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:24,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1070818634, now seen corresponding path program 1 times [2024-10-11 05:01:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:24,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856214750] [2024-10-11 05:01:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:24,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:01:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:01:24,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:24,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856214750] [2024-10-11 05:01:24,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856214750] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:24,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387152051] [2024-10-11 05:01:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:24,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:24,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:24,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:24,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:01:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:24,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:01:24,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:01:24,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387152051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:24,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:01:24,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866824734] [2024-10-11 05:01:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:24,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:24,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:24,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:24,519 INFO L87 Difference]: Start difference. First operand 748 states and 1075 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:24,682 INFO L93 Difference]: Finished difference Result 1151 states and 1635 transitions. [2024-10-11 05:01:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:01:24,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:01:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:24,687 INFO L225 Difference]: With dead ends: 1151 [2024-10-11 05:01:24,687 INFO L226 Difference]: Without dead ends: 756 [2024-10-11 05:01:24,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:24,690 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 0 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:24,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1390 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:01:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-11 05:01:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2024-10-11 05:01:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 662 states have (on average 1.4214501510574018) internal successors, (941), 672 states have internal predecessors, (941), 60 states have call successors, (60), 30 states have call predecessors, (60), 32 states have return successors, (76), 54 states have call predecessors, (76), 56 states have call successors, (76) [2024-10-11 05:01:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1077 transitions. [2024-10-11 05:01:24,743 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1077 transitions. Word has length 60 [2024-10-11 05:01:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:24,744 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1077 transitions. [2024-10-11 05:01:24,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1077 transitions. [2024-10-11 05:01:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:01:24,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:24,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:24,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:01:24,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:24,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:24,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 226813132, now seen corresponding path program 1 times [2024-10-11 05:01:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:24,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653658295] [2024-10-11 05:01:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:25,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:25,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:01:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:01:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:25,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653658295] [2024-10-11 05:01:25,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653658295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:25,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033571328] [2024-10-11 05:01:25,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:25,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:25,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:25,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:25,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:01:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:25,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:01:25,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:01:25,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033571328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:25,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:25,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:01:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891250360] [2024-10-11 05:01:25,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:25,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:25,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:25,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:25,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:25,189 INFO L87 Difference]: Start difference. First operand 756 states and 1077 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:25,305 INFO L93 Difference]: Finished difference Result 1175 states and 1648 transitions. [2024-10-11 05:01:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:01:25,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:01:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:25,310 INFO L225 Difference]: With dead ends: 1175 [2024-10-11 05:01:25,310 INFO L226 Difference]: Without dead ends: 772 [2024-10-11 05:01:25,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:25,314 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 0 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:25,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1390 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:01:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-10-11 05:01:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2024-10-11 05:01:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 678 states have (on average 1.4041297935103245) internal successors, (952), 688 states have internal predecessors, (952), 60 states have call successors, (60), 30 states have call predecessors, (60), 32 states have return successors, (75), 54 states have call predecessors, (75), 56 states have call successors, (75) [2024-10-11 05:01:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1087 transitions. [2024-10-11 05:01:25,357 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1087 transitions. Word has length 60 [2024-10-11 05:01:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:25,357 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1087 transitions. [2024-10-11 05:01:25,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:01:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1087 transitions. [2024-10-11 05:01:25,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:01:25,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:25,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:25,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 05:01:25,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:25,561 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:25,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2024452748, now seen corresponding path program 1 times [2024-10-11 05:01:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390220769] [2024-10-11 05:01:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:25,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:01:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:01:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:25,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390220769] [2024-10-11 05:01:25,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390220769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:25,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:25,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:01:25,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651377380] [2024-10-11 05:01:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:25,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:01:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:01:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:25,694 INFO L87 Difference]: Start difference. First operand 772 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:01:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:26,209 INFO L93 Difference]: Finished difference Result 857 states and 1190 transitions. [2024-10-11 05:01:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:01:26,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-11 05:01:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:26,214 INFO L225 Difference]: With dead ends: 857 [2024-10-11 05:01:26,215 INFO L226 Difference]: Without dead ends: 854 [2024-10-11 05:01:26,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:01:26,216 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1130 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:26,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 590 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:01:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-10-11 05:01:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 771. [2024-10-11 05:01:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 678 states have (on average 1.40117994100295) internal successors, (950), 687 states have internal predecessors, (950), 59 states have call successors, (59), 30 states have call predecessors, (59), 32 states have return successors, (75), 54 states have call predecessors, (75), 56 states have call successors, (75) [2024-10-11 05:01:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1084 transitions. [2024-10-11 05:01:26,265 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1084 transitions. Word has length 60 [2024-10-11 05:01:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:26,265 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1084 transitions. [2024-10-11 05:01:26,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:01:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1084 transitions. [2024-10-11 05:01:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 05:01:26,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:26,268 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:26,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:01:26,268 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:26,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1667610304, now seen corresponding path program 1 times [2024-10-11 05:01:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:26,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017149391] [2024-10-11 05:01:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:26,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:01:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:01:26,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:26,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017149391] [2024-10-11 05:01:26,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017149391] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:26,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109280578] [2024-10-11 05:01:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:26,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:26,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:26,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:26,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:01:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:26,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:01:26,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:26,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:01:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:01:26,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109280578] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:01:26,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:01:26,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-11 05:01:26,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101011609] [2024-10-11 05:01:26,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:01:26,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:01:26,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:26,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:01:26,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:01:26,867 INFO L87 Difference]: Start difference. First operand 771 states and 1084 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:01:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:27,818 INFO L93 Difference]: Finished difference Result 1574 states and 2119 transitions. [2024-10-11 05:01:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 05:01:27,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-11 05:01:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:27,828 INFO L225 Difference]: With dead ends: 1574 [2024-10-11 05:01:27,828 INFO L226 Difference]: Without dead ends: 1571 [2024-10-11 05:01:27,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 05:01:27,830 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 859 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:27,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 1642 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:01:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2024-10-11 05:01:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1074. [2024-10-11 05:01:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 945 states have (on average 1.3714285714285714) internal successors, (1296), 960 states have internal predecessors, (1296), 78 states have call successors, (78), 43 states have call predecessors, (78), 49 states have return successors, (105), 71 states have call predecessors, (105), 75 states have call successors, (105) [2024-10-11 05:01:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1479 transitions. [2024-10-11 05:01:27,907 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1479 transitions. Word has length 61 [2024-10-11 05:01:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:27,907 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1479 transitions. [2024-10-11 05:01:27,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:01:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1479 transitions. [2024-10-11 05:01:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 05:01:27,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:27,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:27,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 05:01:28,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:28,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash -278499280, now seen corresponding path program 2 times [2024-10-11 05:01:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205166667] [2024-10-11 05:01:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:01:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 05:01:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:28,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205166667] [2024-10-11 05:01:28,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205166667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:28,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:28,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:01:28,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954532534] [2024-10-11 05:01:28,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:28,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:01:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:01:28,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:01:28,179 INFO L87 Difference]: Start difference. First operand 1074 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:01:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:28,639 INFO L93 Difference]: Finished difference Result 1702 states and 2296 transitions. [2024-10-11 05:01:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:01:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-11 05:01:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:28,646 INFO L225 Difference]: With dead ends: 1702 [2024-10-11 05:01:28,647 INFO L226 Difference]: Without dead ends: 1043 [2024-10-11 05:01:28,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:28,649 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 683 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:28,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 609 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:01:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2024-10-11 05:01:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 966. [2024-10-11 05:01:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 850 states have (on average 1.3741176470588234) internal successors, (1168), 865 states have internal predecessors, (1168), 71 states have call successors, (71), 38 states have call predecessors, (71), 43 states have return successors, (94), 63 states have call predecessors, (94), 68 states have call successors, (94) [2024-10-11 05:01:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1333 transitions. [2024-10-11 05:01:28,708 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1333 transitions. Word has length 78 [2024-10-11 05:01:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:28,709 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1333 transitions. [2024-10-11 05:01:28,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:01:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1333 transitions. [2024-10-11 05:01:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:01:28,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:28,715 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:28,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:01:28,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:28,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1563098343, now seen corresponding path program 1 times [2024-10-11 05:01:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637765164] [2024-10-11 05:01:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:28,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 05:01:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 05:01:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 05:01:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 05:01:28,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637765164] [2024-10-11 05:01:28,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637765164] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541544173] [2024-10-11 05:01:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:28,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:28,836 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:28,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:01:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:28,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:01:28,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:28,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541544173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:28,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:28,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 05:01:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275665443] [2024-10-11 05:01:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:28,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:28,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:01:28,988 INFO L87 Difference]: Start difference. First operand 966 states and 1333 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:01:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:29,086 INFO L93 Difference]: Finished difference Result 1249 states and 1689 transitions. [2024-10-11 05:01:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:29,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-11 05:01:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:29,104 INFO L225 Difference]: With dead ends: 1249 [2024-10-11 05:01:29,105 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 05:01:29,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:01:29,108 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 55 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:29,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 944 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:01:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 05:01:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-10-11 05:01:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 231 states have (on average 1.6233766233766234) internal successors, (375), 233 states have internal predecessors, (375), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 05:01:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 421 transitions. [2024-10-11 05:01:29,128 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 421 transitions. Word has length 92 [2024-10-11 05:01:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:29,129 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 421 transitions. [2024-10-11 05:01:29,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:01:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 421 transitions. [2024-10-11 05:01:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:29,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:29,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:29,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 05:01:29,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 05:01:29,332 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:29,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1971697741, now seen corresponding path program 1 times [2024-10-11 05:01:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:29,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417548847] [2024-10-11 05:01:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:29,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417548847] [2024-10-11 05:01:29,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417548847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:29,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:29,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:01:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493372133] [2024-10-11 05:01:29,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:29,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:01:29,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:01:29,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:01:29,509 INFO L87 Difference]: Start difference. First operand 262 states and 421 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:30,717 INFO L93 Difference]: Finished difference Result 607 states and 992 transitions. [2024-10-11 05:01:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:01:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:30,720 INFO L225 Difference]: With dead ends: 607 [2024-10-11 05:01:30,720 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 05:01:30,721 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-11 05:01:30,721 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 705 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:30,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 487 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:01:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 05:01:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 262. [2024-10-11 05:01:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 231 states have (on average 1.619047619047619) internal successors, (374), 233 states have internal predecessors, (374), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 05:01:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 420 transitions. [2024-10-11 05:01:30,740 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 420 transitions. Word has length 122 [2024-10-11 05:01:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:30,741 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 420 transitions. [2024-10-11 05:01:30,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 420 transitions. [2024-10-11 05:01:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:30,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:30,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:30,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:01:30,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash 321383285, now seen corresponding path program 1 times [2024-10-11 05:01:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681701269] [2024-10-11 05:01:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:30,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:30,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681701269] [2024-10-11 05:01:30,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681701269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:01:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614754734] [2024-10-11 05:01:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:30,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:01:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:30,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:01:30,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:01:30,953 INFO L87 Difference]: Start difference. First operand 262 states and 420 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:32,971 INFO L93 Difference]: Finished difference Result 947 states and 1554 transitions. [2024-10-11 05:01:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:01:32,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:32,976 INFO L225 Difference]: With dead ends: 947 [2024-10-11 05:01:32,977 INFO L226 Difference]: Without dead ends: 700 [2024-10-11 05:01:32,978 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-11 05:01:32,978 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1057 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:32,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 820 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 05:01:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-11 05:01:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 519. [2024-10-11 05:01:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 464 states have (on average 1.6293103448275863) internal successors, (756), 467 states have internal predecessors, (756), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-11 05:01:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 839 transitions. [2024-10-11 05:01:33,051 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 839 transitions. Word has length 122 [2024-10-11 05:01:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:33,051 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 839 transitions. [2024-10-11 05:01:33,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 839 transitions. [2024-10-11 05:01:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:33,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:33,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:33,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:01:33,053 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:33,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash 45457973, now seen corresponding path program 1 times [2024-10-11 05:01:33,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:33,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204071995] [2024-10-11 05:01:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:33,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:33,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:33,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204071995] [2024-10-11 05:01:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204071995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:33,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:33,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684713332] [2024-10-11 05:01:33,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:33,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:33,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:33,292 INFO L87 Difference]: Start difference. First operand 519 states and 839 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:35,818 INFO L93 Difference]: Finished difference Result 1562 states and 2564 transitions. [2024-10-11 05:01:35,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:01:35,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:35,824 INFO L225 Difference]: With dead ends: 1562 [2024-10-11 05:01:35,825 INFO L226 Difference]: Without dead ends: 1058 [2024-10-11 05:01:35,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:01:35,827 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 1076 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:35,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1561 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 05:01:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-10-11 05:01:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 757. [2024-10-11 05:01:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 678 states have (on average 1.6224188790560472) internal successors, (1100), 682 states have internal predecessors, (1100), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-11 05:01:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1219 transitions. [2024-10-11 05:01:35,890 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1219 transitions. Word has length 122 [2024-10-11 05:01:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:35,890 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1219 transitions. [2024-10-11 05:01:35,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1219 transitions. [2024-10-11 05:01:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:35,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:35,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:35,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:01:35,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:35,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:35,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1434751987, now seen corresponding path program 1 times [2024-10-11 05:01:35,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:35,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589154549] [2024-10-11 05:01:35,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:35,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:35,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:36,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:36,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:36,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:36,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589154549] [2024-10-11 05:01:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589154549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:36,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173147271] [2024-10-11 05:01:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:36,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:36,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:36,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:36,121 INFO L87 Difference]: Start difference. First operand 757 states and 1219 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:38,260 INFO L93 Difference]: Finished difference Result 2463 states and 4036 transitions. [2024-10-11 05:01:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:01:38,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:38,270 INFO L225 Difference]: With dead ends: 2463 [2024-10-11 05:01:38,270 INFO L226 Difference]: Without dead ends: 1721 [2024-10-11 05:01:38,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:01:38,273 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1156 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:38,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1014 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:01:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-10-11 05:01:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1234. [2024-10-11 05:01:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1107 states have (on average 1.6160794941282746) internal successors, (1789), 1113 states have internal predecessors, (1789), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 05:01:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1984 transitions. [2024-10-11 05:01:38,372 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1984 transitions. Word has length 122 [2024-10-11 05:01:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:38,372 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1984 transitions. [2024-10-11 05:01:38,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1984 transitions. [2024-10-11 05:01:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:38,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:38,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:38,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:01:38,375 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:38,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:38,375 INFO L85 PathProgramCache]: Analyzing trace with hash -598642059, now seen corresponding path program 1 times [2024-10-11 05:01:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:38,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657922515] [2024-10-11 05:01:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:38,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:38,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:38,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657922515] [2024-10-11 05:01:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657922515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:38,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:38,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955750354] [2024-10-11 05:01:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:38,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:38,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:38,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:38,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:38,600 INFO L87 Difference]: Start difference. First operand 1234 states and 1984 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:39,802 INFO L93 Difference]: Finished difference Result 2928 states and 4792 transitions. [2024-10-11 05:01:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:01:39,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:39,812 INFO L225 Difference]: With dead ends: 2928 [2024-10-11 05:01:39,813 INFO L226 Difference]: Without dead ends: 1709 [2024-10-11 05:01:39,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:01:39,817 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 889 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:39,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 663 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:01:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2024-10-11 05:01:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1234. [2024-10-11 05:01:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1107 states have (on average 1.6115627822944896) internal successors, (1784), 1113 states have internal predecessors, (1784), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 05:01:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1979 transitions. [2024-10-11 05:01:39,944 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1979 transitions. Word has length 122 [2024-10-11 05:01:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:39,945 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1979 transitions. [2024-10-11 05:01:39,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1979 transitions. [2024-10-11 05:01:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:39,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:39,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:39,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:01:39,947 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:39,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1829616563, now seen corresponding path program 1 times [2024-10-11 05:01:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:39,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652442629] [2024-10-11 05:01:39,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:40,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:40,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:40,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652442629] [2024-10-11 05:01:40,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652442629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:40,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:40,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:40,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142131871] [2024-10-11 05:01:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:40,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:40,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:40,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:40,146 INFO L87 Difference]: Start difference. First operand 1234 states and 1979 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:41,264 INFO L93 Difference]: Finished difference Result 2922 states and 4766 transitions. [2024-10-11 05:01:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:01:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:41,273 INFO L225 Difference]: With dead ends: 2922 [2024-10-11 05:01:41,274 INFO L226 Difference]: Without dead ends: 1703 [2024-10-11 05:01:41,277 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-11 05:01:41,278 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 887 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:41,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 663 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:01:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-10-11 05:01:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1234. [2024-10-11 05:01:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1107 states have (on average 1.6070460704607046) internal successors, (1779), 1113 states have internal predecessors, (1779), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 05:01:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1974 transitions. [2024-10-11 05:01:41,382 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1974 transitions. Word has length 122 [2024-10-11 05:01:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:41,382 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1974 transitions. [2024-10-11 05:01:41,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1974 transitions. [2024-10-11 05:01:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:41,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:41,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:41,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:01:41,385 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:41,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 522474165, now seen corresponding path program 1 times [2024-10-11 05:01:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:41,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066274727] [2024-10-11 05:01:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:41,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:41,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:41,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:41,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066274727] [2024-10-11 05:01:41,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066274727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:41,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:41,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:41,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71296913] [2024-10-11 05:01:41,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:41,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:41,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:41,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:41,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:41,577 INFO L87 Difference]: Start difference. First operand 1234 states and 1974 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:42,745 INFO L93 Difference]: Finished difference Result 2915 states and 4738 transitions. [2024-10-11 05:01:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:01:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:42,755 INFO L225 Difference]: With dead ends: 2915 [2024-10-11 05:01:42,756 INFO L226 Difference]: Without dead ends: 1696 [2024-10-11 05:01:42,759 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-11 05:01:42,760 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 776 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:42,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 791 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:01:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2024-10-11 05:01:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1234. [2024-10-11 05:01:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1107 states have (on average 1.6025293586269196) internal successors, (1774), 1113 states have internal predecessors, (1774), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 05:01:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1969 transitions. [2024-10-11 05:01:42,948 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1969 transitions. Word has length 122 [2024-10-11 05:01:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:42,949 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1969 transitions. [2024-10-11 05:01:42,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1969 transitions. [2024-10-11 05:01:42,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:42,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:42,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:42,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:01:42,952 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:42,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1874996365, now seen corresponding path program 1 times [2024-10-11 05:01:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:42,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307127784] [2024-10-11 05:01:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307127784] [2024-10-11 05:01:43,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307127784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:43,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668404577] [2024-10-11 05:01:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:43,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:43,161 INFO L87 Difference]: Start difference. First operand 1234 states and 1969 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:45,647 INFO L93 Difference]: Finished difference Result 4169 states and 6737 transitions. [2024-10-11 05:01:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:01:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:45,661 INFO L225 Difference]: With dead ends: 4169 [2024-10-11 05:01:45,661 INFO L226 Difference]: Without dead ends: 2950 [2024-10-11 05:01:45,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:01:45,665 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1050 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:45,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 1559 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 05:01:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2024-10-11 05:01:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2201. [2024-10-11 05:01:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2201 states, 1978 states have (on average 1.5950455005055613) internal successors, (3155), 1988 states have internal predecessors, (3155), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-11 05:01:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 3508 transitions. [2024-10-11 05:01:45,873 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 3508 transitions. Word has length 122 [2024-10-11 05:01:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:45,873 INFO L471 AbstractCegarLoop]: Abstraction has 2201 states and 3508 transitions. [2024-10-11 05:01:45,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 3508 transitions. [2024-10-11 05:01:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:45,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:45,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:45,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:01:45,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash -843955467, now seen corresponding path program 1 times [2024-10-11 05:01:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080964685] [2024-10-11 05:01:45,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:46,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:46,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:46,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:46,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080964685] [2024-10-11 05:01:46,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080964685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:46,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:46,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602709157] [2024-10-11 05:01:46,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:46,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:46,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:46,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:46,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:46,067 INFO L87 Difference]: Start difference. First operand 2201 states and 3508 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:48,426 INFO L93 Difference]: Finished difference Result 7614 states and 12294 transitions. [2024-10-11 05:01:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:01:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:48,452 INFO L225 Difference]: With dead ends: 7614 [2024-10-11 05:01:48,453 INFO L226 Difference]: Without dead ends: 5428 [2024-10-11 05:01:48,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:01:48,461 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1046 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:48,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 1559 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 05:01:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5428 states. [2024-10-11 05:01:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5428 to 4144. [2024-10-11 05:01:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 3729 states have (on average 1.590506838294449) internal successors, (5931), 3747 states have internal predecessors, (5931), 296 states have call successors, (296), 103 states have call predecessors, (296), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-11 05:01:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 6618 transitions. [2024-10-11 05:01:49,000 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 6618 transitions. Word has length 122 [2024-10-11 05:01:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:49,001 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 6618 transitions. [2024-10-11 05:01:49,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 6618 transitions. [2024-10-11 05:01:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:49,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:49,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:49,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:01:49,006 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:49,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash 757115639, now seen corresponding path program 1 times [2024-10-11 05:01:49,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:49,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515241866] [2024-10-11 05:01:49,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:49,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:49,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:49,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:49,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:49,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515241866] [2024-10-11 05:01:49,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515241866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:49,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:49,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:49,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919384463] [2024-10-11 05:01:49,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:49,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:49,243 INFO L87 Difference]: Start difference. First operand 4144 states and 6618 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:52,207 INFO L93 Difference]: Finished difference Result 16181 states and 26164 transitions. [2024-10-11 05:01:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:01:52,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:52,249 INFO L225 Difference]: With dead ends: 16181 [2024-10-11 05:01:52,249 INFO L226 Difference]: Without dead ends: 12052 [2024-10-11 05:01:52,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:01:52,266 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1339 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 2581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:52,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 1552 Invalid, 2581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 05:01:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12052 states. [2024-10-11 05:01:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12052 to 8011. [2024-10-11 05:01:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8011 states, 7228 states have (on average 1.5889596015495295) internal successors, (11485), 7262 states have internal predecessors, (11485), 552 states have call successors, (552), 199 states have call predecessors, (552), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-11 05:01:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 12862 transitions. [2024-10-11 05:01:53,064 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 12862 transitions. Word has length 122 [2024-10-11 05:01:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:53,065 INFO L471 AbstractCegarLoop]: Abstraction has 8011 states and 12862 transitions. [2024-10-11 05:01:53,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 12862 transitions. [2024-10-11 05:01:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:53,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:53,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:53,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:01:53,073 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:53,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash -299615563, now seen corresponding path program 1 times [2024-10-11 05:01:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:53,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392502040] [2024-10-11 05:01:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:53,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:53,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:53,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:53,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:53,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392502040] [2024-10-11 05:01:53,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392502040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:53,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:53,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:53,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754543378] [2024-10-11 05:01:53,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:53,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:53,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:53,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:53,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:53,266 INFO L87 Difference]: Start difference. First operand 8011 states and 12862 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:57,120 INFO L93 Difference]: Finished difference Result 31202 states and 50698 transitions. [2024-10-11 05:01:57,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:01:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:01:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:57,204 INFO L225 Difference]: With dead ends: 31202 [2024-10-11 05:01:57,205 INFO L226 Difference]: Without dead ends: 23206 [2024-10-11 05:01:57,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:01:57,239 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1179 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:57,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 1062 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2644 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 05:01:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23206 states. [2024-10-11 05:01:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23206 to 15424. [2024-10-11 05:01:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15424 states, 13921 states have (on average 1.5837224337332088) internal successors, (22047), 13987 states have internal predecessors, (22047), 1048 states have call successors, (1048), 391 states have call predecessors, (1048), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-11 05:01:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15424 states to 15424 states and 24934 transitions. [2024-10-11 05:01:58,536 INFO L78 Accepts]: Start accepts. Automaton has 15424 states and 24934 transitions. Word has length 122 [2024-10-11 05:01:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:58,537 INFO L471 AbstractCegarLoop]: Abstraction has 15424 states and 24934 transitions. [2024-10-11 05:01:58,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 15424 states and 24934 transitions. [2024-10-11 05:01:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:01:58,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:58,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:58,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:01:58,549 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:58,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:58,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1051769655, now seen corresponding path program 1 times [2024-10-11 05:01:58,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:58,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741333894] [2024-10-11 05:01:58,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:58,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:01:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:01:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:01:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:01:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:58,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:58,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741333894] [2024-10-11 05:01:58,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741333894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:01:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986072111] [2024-10-11 05:01:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:58,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:01:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:58,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:01:58,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:58,711 INFO L87 Difference]: Start difference. First operand 15424 states and 24934 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:01,397 INFO L93 Difference]: Finished difference Result 35446 states and 58292 transitions. [2024-10-11 05:02:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:02:01,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:02:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:01,499 INFO L225 Difference]: With dead ends: 35446 [2024-10-11 05:02:01,500 INFO L226 Difference]: Without dead ends: 20037 [2024-10-11 05:02:01,562 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-11 05:02:01,563 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 889 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:01,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 662 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:02:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20037 states. [2024-10-11 05:02:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20037 to 15424. [2024-10-11 05:02:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15424 states, 13921 states have (on average 1.579053228934703) internal successors, (21982), 13987 states have internal predecessors, (21982), 1048 states have call successors, (1048), 391 states have call predecessors, (1048), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-11 05:02:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15424 states to 15424 states and 24869 transitions. [2024-10-11 05:02:02,960 INFO L78 Accepts]: Start accepts. Automaton has 15424 states and 24869 transitions. Word has length 122 [2024-10-11 05:02:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:02,960 INFO L471 AbstractCegarLoop]: Abstraction has 15424 states and 24869 transitions. [2024-10-11 05:02:02,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 15424 states and 24869 transitions. [2024-10-11 05:02:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:02:02,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:02,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:02:02,971 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:02,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -567205259, now seen corresponding path program 1 times [2024-10-11 05:02:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808235898] [2024-10-11 05:02:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:03,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:03,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:02:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:03,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:02:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:02:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:02:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:03,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808235898] [2024-10-11 05:02:03,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808235898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:03,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:03,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:03,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492146885] [2024-10-11 05:02:03,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:03,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:03,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:03,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:03,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:03,142 INFO L87 Difference]: Start difference. First operand 15424 states and 24869 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:08,877 INFO L93 Difference]: Finished difference Result 59003 states and 96248 transitions. [2024-10-11 05:02:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:02:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:02:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:09,056 INFO L225 Difference]: With dead ends: 59003 [2024-10-11 05:02:09,056 INFO L226 Difference]: Without dead ends: 43594 [2024-10-11 05:02:09,110 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-11 05:02:09,110 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1083 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:09,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1552 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 05:02:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43594 states. [2024-10-11 05:02:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43594 to 30634. [2024-10-11 05:02:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30634 states, 27723 states have (on average 1.577967752407748) internal successors, (43746), 27853 states have internal predecessors, (43746), 2008 states have call successors, (2008), 775 states have call predecessors, (2008), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-11 05:02:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30634 states to 30634 states and 50075 transitions. [2024-10-11 05:02:11,915 INFO L78 Accepts]: Start accepts. Automaton has 30634 states and 50075 transitions. Word has length 122 [2024-10-11 05:02:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:11,916 INFO L471 AbstractCegarLoop]: Abstraction has 30634 states and 50075 transitions. [2024-10-11 05:02:11,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30634 states and 50075 transitions. [2024-10-11 05:02:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:02:11,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:11,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:11,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:02:11,940 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:11,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1450714249, now seen corresponding path program 1 times [2024-10-11 05:02:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733996555] [2024-10-11 05:02:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:12,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:02:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:12,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:02:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:02:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:02:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:12,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:12,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733996555] [2024-10-11 05:02:12,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733996555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:12,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:12,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:12,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79542222] [2024-10-11 05:02:12,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:12,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:12,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:12,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:12,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:12,107 INFO L87 Difference]: Start difference. First operand 30634 states and 50075 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:21,352 INFO L93 Difference]: Finished difference Result 115443 states and 190976 transitions. [2024-10-11 05:02:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:02:21,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-11 05:02:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:21,712 INFO L225 Difference]: With dead ends: 115443 [2024-10-11 05:02:21,712 INFO L226 Difference]: Without dead ends: 84824 [2024-10-11 05:02:21,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:02:21,815 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1189 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:21,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 1552 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 05:02:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84824 states. [2024-10-11 05:02:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84824 to 61051. [2024-10-11 05:02:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61051 states, 55388 states have (on average 1.5778869069112442) internal successors, (87396), 55646 states have internal predecessors, (87396), 3864 states have call successors, (3864), 1543 states have call predecessors, (3864), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-11 05:02:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61051 states to 61051 states and 101939 transitions. [2024-10-11 05:02:27,533 INFO L78 Accepts]: Start accepts. Automaton has 61051 states and 101939 transitions. Word has length 122 [2024-10-11 05:02:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:27,534 INFO L471 AbstractCegarLoop]: Abstraction has 61051 states and 101939 transitions. [2024-10-11 05:02:27,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 61051 states and 101939 transitions. [2024-10-11 05:02:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:02:27,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:27,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:27,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:02:27,580 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:27,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:27,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1479214539, now seen corresponding path program 1 times [2024-10-11 05:02:27,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:27,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298268088] [2024-10-11 05:02:27,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:27,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:27,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:02:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:27,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:02:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:27,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:02:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:02:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298268088] [2024-10-11 05:02:27,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298268088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:27,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:27,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:27,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819424506] [2024-10-11 05:02:27,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:27,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:27,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:27,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:27,747 INFO L87 Difference]: Start difference. First operand 61051 states and 101939 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)