./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.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9fe331e5302255756e033832e890b54b7bae1c0bb354f9ba1bbe18985f952e5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:11:00,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:11:00,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:11:00,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:11:00,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:11:00,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:11:00,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:11:00,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:11:00,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:11:00,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:11:00,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:11:00,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:11:00,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:11:00,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:11:00,634 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:11:00,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:11:00,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:11:00,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:11:00,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:11:00,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:11:00,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:11:00,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:11:00,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:11:00,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:11:00,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:11:00,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:11:00,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:11:00,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:11:00,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:11:00,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:11:00,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:11:00,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:11:00,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:11:00,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:11:00,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:11:00,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:11:00,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:11:00,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:11:00,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:11:00,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:11:00,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:11:00,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:11:00,641 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9fe331e5302255756e033832e890b54b7bae1c0bb354f9ba1bbe18985f952e5 [2024-10-14 05:11:00,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:11:00,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:11:00,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:11:00,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:11:00,824 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:11:00,825 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.15.cil.c [2024-10-14 05:11:02,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:11:02,582 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:11:02,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c [2024-10-14 05:11:02,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c9eea22/3fc6eed4f01140feb38744102d776693/FLAG3274384e0 [2024-10-14 05:11:02,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c9eea22/3fc6eed4f01140feb38744102d776693 [2024-10-14 05:11:02,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:11:02,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:11:02,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:11:02,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:11:02,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:11:02,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:02" (1/1) ... [2024-10-14 05:11:02,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338ce748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:02, skipping insertion in model container [2024-10-14 05:11:02,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:02" (1/1) ... [2024-10-14 05:11:02,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:11:02,851 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.15.cil.c[913,926] [2024-10-14 05:11:02,904 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.15.cil.c[5977,5990] [2024-10-14 05:11:03,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:11:03,027 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:11:03,037 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.15.cil.c[913,926] [2024-10-14 05:11:03,052 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.15.cil.c[5977,5990] [2024-10-14 05:11:03,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:11:03,193 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:11:03,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03 WrapperNode [2024-10-14 05:11:03,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:11:03,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:11:03,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:11:03,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:11:03,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,307 INFO L138 Inliner]: procedures = 74, calls = 88, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1147 [2024-10-14 05:11:03,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:11:03,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:11:03,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:11:03,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:11:03,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,357 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 05:11:03,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:11:03,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:11:03,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:11:03,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:11:03,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (1/1) ... [2024-10-14 05:11:03,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:11:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:03,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:11:03,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:11:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:11:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:11:03,507 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:11:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-14 05:11:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-14 05:11:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:11:03,509 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:11:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:11:03,509 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:11:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:11:03,510 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:11:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:11:03,510 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:11:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:11:03,510 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:11:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:11:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:11:03,511 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:11:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:11:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:11:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:11:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:11:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-14 05:11:03,513 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-14 05:11:03,665 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:11:03,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:11:04,567 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-10-14 05:11:04,567 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:11:04,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:11:04,629 INFO L314 CfgBuilder]: Removed 20 assume(true) statements. [2024-10-14 05:11:04,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:04 BoogieIcfgContainer [2024-10-14 05:11:04,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:11:04,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:11:04,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:11:04,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:11:04,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:11:02" (1/3) ... [2024-10-14 05:11:04,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7215320e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:04, skipping insertion in model container [2024-10-14 05:11:04,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:03" (2/3) ... [2024-10-14 05:11:04,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7215320e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:04, skipping insertion in model container [2024-10-14 05:11:04,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:04" (3/3) ... [2024-10-14 05:11:04,638 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.15.cil.c [2024-10-14 05:11:04,650 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:11:04,650 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:11:04,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:11:04,747 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;@736194e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:11:04,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:11:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 440 states, 392 states have (on average 1.7295918367346939) internal successors, (678), 399 states have internal predecessors, (678), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 05:11:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 05:11:04,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:04,769 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-14 05:11:04,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:04,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1740532851, now seen corresponding path program 1 times [2024-10-14 05:11:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417623809] [2024-10-14 05:11:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:04,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:05,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:05,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417623809] [2024-10-14 05:11:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417623809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:05,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:11:05,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963060702] [2024-10-14 05:11:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:05,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:11:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:11:05,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:11:05,152 INFO L87 Difference]: Start difference. First operand has 440 states, 392 states have (on average 1.7295918367346939) internal successors, (678), 399 states have internal predecessors, (678), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) 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-14 05:11:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:06,002 INFO L93 Difference]: Finished difference Result 864 states and 1464 transitions. [2024-10-14 05:11:06,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:11:06,005 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-14 05:11:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:06,016 INFO L225 Difference]: With dead ends: 864 [2024-10-14 05:11:06,017 INFO L226 Difference]: Without dead ends: 442 [2024-10-14 05:11:06,026 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-14 05:11:06,031 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 382 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:06,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 961 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:11:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-14 05:11:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 434. [2024-10-14 05:11:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 389 states have (on average 1.6195372750642674) internal successors, (630), 393 states have internal predecessors, (630), 35 states have call successors, (35), 10 states have call predecessors, (35), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 05:11:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 696 transitions. [2024-10-14 05:11:06,112 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 696 transitions. Word has length 37 [2024-10-14 05:11:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:06,113 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 696 transitions. [2024-10-14 05:11:06,113 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-14 05:11:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 696 transitions. [2024-10-14 05:11:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 05:11:06,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:06,116 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-14 05:11:06,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:11:06,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:06,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:06,117 INFO L85 PathProgramCache]: Analyzing trace with hash 503450447, now seen corresponding path program 1 times [2024-10-14 05:11:06,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127935257] [2024-10-14 05:11:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:06,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127935257] [2024-10-14 05:11:06,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127935257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:06,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:06,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:11:06,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766489027] [2024-10-14 05:11:06,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:06,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:11:06,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:11:06,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:11:06,209 INFO L87 Difference]: Start difference. First operand 434 states and 696 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-14 05:11:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:06,736 INFO L93 Difference]: Finished difference Result 553 states and 868 transitions. [2024-10-14 05:11:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:11:06,737 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-14 05:11:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:06,741 INFO L225 Difference]: With dead ends: 553 [2024-10-14 05:11:06,741 INFO L226 Difference]: Without dead ends: 497 [2024-10-14 05:11:06,742 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-14 05:11:06,743 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 946 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:06,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 735 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-14 05:11:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 491. [2024-10-14 05:11:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 439 states have (on average 1.5922551252847381) internal successors, (699), 444 states have internal predecessors, (699), 39 states have call successors, (39), 12 states have call predecessors, (39), 11 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2024-10-14 05:11:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 779 transitions. [2024-10-14 05:11:06,792 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 779 transitions. Word has length 37 [2024-10-14 05:11:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:06,793 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 779 transitions. [2024-10-14 05:11:06,796 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-14 05:11:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 779 transitions. [2024-10-14 05:11:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 05:11:06,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:06,799 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-14 05:11:06,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:11:06,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1800984901, now seen corresponding path program 1 times [2024-10-14 05:11:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729370082] [2024-10-14 05:11:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:06,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:06,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:06,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729370082] [2024-10-14 05:11:06,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729370082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:06,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:06,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:11:06,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962289997] [2024-10-14 05:11:06,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:06,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:11:06,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:11:06,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:11:06,910 INFO L87 Difference]: Start difference. First operand 491 states and 779 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-14 05:11:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:07,683 INFO L93 Difference]: Finished difference Result 725 states and 1123 transitions. [2024-10-14 05:11:07,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:11:07,684 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-14 05:11:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:07,692 INFO L225 Difference]: With dead ends: 725 [2024-10-14 05:11:07,692 INFO L226 Difference]: Without dead ends: 614 [2024-10-14 05:11:07,693 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-14 05:11:07,696 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 964 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:07,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 742 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:11:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-10-14 05:11:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 591. [2024-10-14 05:11:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 526 states have (on average 1.553231939163498) internal successors, (817), 532 states have internal predecessors, (817), 47 states have call successors, (47), 16 states have call predecessors, (47), 16 states have return successors, (55), 43 states have call predecessors, (55), 43 states have call successors, (55) [2024-10-14 05:11:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 919 transitions. [2024-10-14 05:11:07,745 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 919 transitions. Word has length 38 [2024-10-14 05:11:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:07,746 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 919 transitions. [2024-10-14 05:11:07,746 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-14 05:11:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 919 transitions. [2024-10-14 05:11:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 05:11:07,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:07,751 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-14 05:11:07,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:11:07,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:07,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash -335941947, now seen corresponding path program 1 times [2024-10-14 05:11:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:07,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797564598] [2024-10-14 05:11:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:07,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:11:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:07,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:07,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797564598] [2024-10-14 05:11:07,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797564598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:07,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:07,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:11:07,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006792165] [2024-10-14 05:11:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:07,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:11:07,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:11:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:11:07,837 INFO L87 Difference]: Start difference. First operand 591 states and 919 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-14 05:11:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:08,700 INFO L93 Difference]: Finished difference Result 1011 states and 1500 transitions. [2024-10-14 05:11:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:11:08,701 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-14 05:11:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:08,706 INFO L225 Difference]: With dead ends: 1011 [2024-10-14 05:11:08,706 INFO L226 Difference]: Without dead ends: 800 [2024-10-14 05:11:08,707 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-14 05:11:08,708 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 365 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:08,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1056 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:11:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-10-14 05:11:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 696. [2024-10-14 05:11:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 619 states have (on average 1.5282714054927302) internal successors, (946), 627 states have internal predecessors, (946), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (61), 47 states have call predecessors, (61), 49 states have call successors, (61) [2024-10-14 05:11:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1060 transitions. [2024-10-14 05:11:08,761 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1060 transitions. Word has length 39 [2024-10-14 05:11:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:08,762 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 1060 transitions. [2024-10-14 05:11:08,762 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-14 05:11:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1060 transitions. [2024-10-14 05:11:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 05:11:08,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:08,765 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-14 05:11:08,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:11:08,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:08,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:08,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2727102, now seen corresponding path program 1 times [2024-10-14 05:11:08,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:08,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140935237] [2024-10-14 05:11:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:08,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 05:11:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,840 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-14 05:11:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140935237] [2024-10-14 05:11:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140935237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:08,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:08,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:11:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553001527] [2024-10-14 05:11:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:08,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:11:08,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:11:08,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:11:08,842 INFO L87 Difference]: Start difference. First operand 696 states and 1060 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-14 05:11:09,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:09,676 INFO L93 Difference]: Finished difference Result 1001 states and 1482 transitions. [2024-10-14 05:11:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:11:09,677 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-14 05:11:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:09,680 INFO L225 Difference]: With dead ends: 1001 [2024-10-14 05:11:09,680 INFO L226 Difference]: Without dead ends: 790 [2024-10-14 05:11:09,684 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-14 05:11:09,685 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 350 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:09,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1101 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:11:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-14 05:11:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 756. [2024-10-14 05:11:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 670 states have (on average 1.5029850746268656) internal successors, (1007), 679 states have internal predecessors, (1007), 58 states have call successors, (58), 25 states have call predecessors, (58), 26 states have return successors, (70), 52 states have call predecessors, (70), 54 states have call successors, (70) [2024-10-14 05:11:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1135 transitions. [2024-10-14 05:11:09,718 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1135 transitions. Word has length 54 [2024-10-14 05:11:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:09,718 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1135 transitions. [2024-10-14 05:11:09,719 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-14 05:11:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1135 transitions. [2024-10-14 05:11:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:11:09,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:09,724 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-14 05:11:09,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:11:09,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:09,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1531208578, now seen corresponding path program 1 times [2024-10-14 05:11:09,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:09,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740932161] [2024-10-14 05:11:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,782 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-14 05:11:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740932161] [2024-10-14 05:11:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740932161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:09,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:09,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:11:09,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759889210] [2024-10-14 05:11:09,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:09,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:11:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:11:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:11:09,788 INFO L87 Difference]: Start difference. First operand 756 states and 1135 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-14 05:11:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:10,389 INFO L93 Difference]: Finished difference Result 1245 states and 1795 transitions. [2024-10-14 05:11:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:11:10,390 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-14 05:11:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:10,396 INFO L225 Difference]: With dead ends: 1245 [2024-10-14 05:11:10,396 INFO L226 Difference]: Without dead ends: 910 [2024-10-14 05:11:10,397 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-14 05:11:10,397 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 950 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:10,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 754 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:10,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-10-14 05:11:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 861. [2024-10-14 05:11:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 762 states have (on average 1.4698162729658792) internal successors, (1120), 772 states have internal predecessors, (1120), 65 states have call successors, (65), 30 states have call predecessors, (65), 32 states have return successors, (81), 59 states have call predecessors, (81), 61 states have call successors, (81) [2024-10-14 05:11:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1266 transitions. [2024-10-14 05:11:10,430 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1266 transitions. Word has length 59 [2024-10-14 05:11:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:10,430 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1266 transitions. [2024-10-14 05:11:10,430 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-14 05:11:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1266 transitions. [2024-10-14 05:11:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:11:10,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:10,432 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, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:10,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:11:10,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:10,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1753515059, now seen corresponding path program 1 times [2024-10-14 05:11:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:10,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005957640] [2024-10-14 05:11:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:10,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:10,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:10,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:11:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 05:11:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005957640] [2024-10-14 05:11:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005957640] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:11:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420652395] [2024-10-14 05:11:10,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:10,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:10,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:10,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:11:10,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:11:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:10,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:11:10,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:11:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:11:10,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:11:10,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420652395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:10,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:11:10,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:11:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764161195] [2024-10-14 05:11:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:10,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:11:10,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:10,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:11:10,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:10,704 INFO L87 Difference]: Start difference. First operand 861 states and 1266 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 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-14 05:11:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:10,843 INFO L93 Difference]: Finished difference Result 1254 states and 1811 transitions. [2024-10-14 05:11:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:11:10,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 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-14 05:11:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:10,848 INFO L225 Difference]: With dead ends: 1254 [2024-10-14 05:11:10,848 INFO L226 Difference]: Without dead ends: 859 [2024-10-14 05:11:10,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:10,850 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 66 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:10,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1301 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:11:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-10-14 05:11:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 821. [2024-10-14 05:11:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 728 states have (on average 1.4615384615384615) internal successors, (1064), 738 states have internal predecessors, (1064), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (75), 55 states have call predecessors, (75), 57 states have call successors, (75) [2024-10-14 05:11:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1200 transitions. [2024-10-14 05:11:10,888 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1200 transitions. Word has length 60 [2024-10-14 05:11:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:10,889 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1200 transitions. [2024-10-14 05:11:10,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 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-14 05:11:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1200 transitions. [2024-10-14 05:11:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:11:10,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:10,892 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-14 05:11:10,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 05:11:11,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:11,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash -683091380, now seen corresponding path program 1 times [2024-10-14 05:11:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261236219] [2024-10-14 05:11:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:11:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,159 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-14 05:11:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261236219] [2024-10-14 05:11:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261236219] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:11:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321124777] [2024-10-14 05:11:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:11,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:11,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:11,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:11:11,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 05:11:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:11:11,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:11:11,301 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-14 05:11:11,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:11:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321124777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:11,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:11:11,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:11:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959365189] [2024-10-14 05:11:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:11,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:11:11,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:11,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:11:11,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:11:11,302 INFO L87 Difference]: Start difference. First operand 821 states and 1200 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-14 05:11:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:11,470 INFO L93 Difference]: Finished difference Result 1182 states and 1692 transitions. [2024-10-14 05:11:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:11:11,471 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-14 05:11:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:11,474 INFO L225 Difference]: With dead ends: 1182 [2024-10-14 05:11:11,474 INFO L226 Difference]: Without dead ends: 829 [2024-10-14 05:11:11,479 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-14 05:11:11,480 INFO L432 NwaCegarLoop]: 640 mSDtfsCounter, 0 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:11,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1915 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:11:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-14 05:11:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2024-10-14 05:11:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 736 states have (on average 1.4483695652173914) internal successors, (1066), 746 states have internal predecessors, (1066), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (75), 55 states have call predecessors, (75), 57 states have call successors, (75) [2024-10-14 05:11:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1202 transitions. [2024-10-14 05:11:11,533 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1202 transitions. Word has length 60 [2024-10-14 05:11:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:11,533 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1202 transitions. [2024-10-14 05:11:11,533 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-14 05:11:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1202 transitions. [2024-10-14 05:11:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:11:11,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:11,538 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-14 05:11:11,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 05:11:11,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 05:11:11,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:11,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1527096882, now seen corresponding path program 1 times [2024-10-14 05:11:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:11,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471668] [2024-10-14 05:11:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:11:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,842 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-14 05:11:11,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:11,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471668] [2024-10-14 05:11:11,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471668] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:11:11,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215708245] [2024-10-14 05:11:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:11,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:11,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:11,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:11:11,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 05:11:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:11,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:11:11,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:11:11,964 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-14 05:11:11,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:11:11,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215708245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:11,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:11:11,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:11:11,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690744117] [2024-10-14 05:11:11,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:11,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:11:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:11,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:11:11,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:11:11,966 INFO L87 Difference]: Start difference. First operand 829 states and 1202 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-14 05:11:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:12,095 INFO L93 Difference]: Finished difference Result 1188 states and 1682 transitions. [2024-10-14 05:11:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:11:12,096 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-14 05:11:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:12,100 INFO L225 Difference]: With dead ends: 1188 [2024-10-14 05:11:12,100 INFO L226 Difference]: Without dead ends: 845 [2024-10-14 05:11:12,101 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-14 05:11:12,102 INFO L432 NwaCegarLoop]: 640 mSDtfsCounter, 0 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:12,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1915 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:11:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-14 05:11:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2024-10-14 05:11:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 752 states have (on average 1.4321808510638299) internal successors, (1077), 762 states have internal predecessors, (1077), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (74), 55 states have call predecessors, (74), 57 states have call successors, (74) [2024-10-14 05:11:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1212 transitions. [2024-10-14 05:11:12,150 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1212 transitions. Word has length 60 [2024-10-14 05:11:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:12,151 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1212 transitions. [2024-10-14 05:11:12,151 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-14 05:11:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1212 transitions. [2024-10-14 05:11:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:11:12,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:12,153 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-14 05:11:12,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 05:11:12,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:12,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:12,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash 270542734, now seen corresponding path program 1 times [2024-10-14 05:11:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64861148] [2024-10-14 05:11:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:12,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:11:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:12,432 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-14 05:11:12,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:12,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64861148] [2024-10-14 05:11:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64861148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:12,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:12,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:11:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956443858] [2024-10-14 05:11:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:12,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:11:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:12,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:11:12,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:11:12,434 INFO L87 Difference]: Start difference. First operand 845 states and 1212 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-14 05:11:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:12,976 INFO L93 Difference]: Finished difference Result 926 states and 1309 transitions. [2024-10-14 05:11:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:11:12,977 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-14 05:11:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:12,982 INFO L225 Difference]: With dead ends: 926 [2024-10-14 05:11:12,983 INFO L226 Difference]: Without dead ends: 923 [2024-10-14 05:11:12,984 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-14 05:11:12,985 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1583 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:12,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 745 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-10-14 05:11:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 844. [2024-10-14 05:11:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 752 states have (on average 1.4295212765957446) internal successors, (1075), 761 states have internal predecessors, (1075), 60 states have call successors, (60), 28 states have call predecessors, (60), 30 states have return successors, (74), 55 states have call predecessors, (74), 57 states have call successors, (74) [2024-10-14 05:11:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1209 transitions. [2024-10-14 05:11:13,019 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1209 transitions. Word has length 60 [2024-10-14 05:11:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:13,020 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1209 transitions. [2024-10-14 05:11:13,020 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-14 05:11:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1209 transitions. [2024-10-14 05:11:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:11:13,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:13,022 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-14 05:11:13,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:11:13,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:13,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash -204606045, now seen corresponding path program 1 times [2024-10-14 05:11:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:13,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911182445] [2024-10-14 05:11:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:11:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,130 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-14 05:11:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911182445] [2024-10-14 05:11:13,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911182445] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:11:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809908842] [2024-10-14 05:11:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:13,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:13,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:13,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:11:13,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 05:11:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:11:13,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:11:13,541 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-14 05:11:13,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:11:13,664 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-14 05:11:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809908842] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:11:13,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:11:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-14 05:11:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274473535] [2024-10-14 05:11:13,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:11:13,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:11:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:13,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:11:13,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:11:13,666 INFO L87 Difference]: Start difference. First operand 844 states and 1209 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-14 05:11:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:14,719 INFO L93 Difference]: Finished difference Result 1519 states and 2059 transitions. [2024-10-14 05:11:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 05:11:14,719 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-14 05:11:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:14,727 INFO L225 Difference]: With dead ends: 1519 [2024-10-14 05:11:14,728 INFO L226 Difference]: Without dead ends: 1516 [2024-10-14 05:11:14,728 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-14 05:11:14,729 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 1737 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:14,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1771 Valid, 1592 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:11:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-10-14 05:11:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1137. [2024-10-14 05:11:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1009 states have (on average 1.3865213082259662) internal successors, (1399), 1024 states have internal predecessors, (1399), 79 states have call successors, (79), 41 states have call predecessors, (79), 47 states have return successors, (104), 72 states have call predecessors, (104), 76 states have call successors, (104) [2024-10-14 05:11:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1582 transitions. [2024-10-14 05:11:14,798 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1582 transitions. Word has length 61 [2024-10-14 05:11:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:14,800 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1582 transitions. [2024-10-14 05:11:14,800 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-14 05:11:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1582 transitions. [2024-10-14 05:11:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:11:14,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:14,803 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-14 05:11:14,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 05:11:15,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:15,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:15,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:15,007 INFO L85 PathProgramCache]: Analyzing trace with hash 126117954, now seen corresponding path program 2 times [2024-10-14 05:11:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:15,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885515562] [2024-10-14 05:11:15,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:15,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:11:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 05:11:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,104 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-14 05:11:15,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:15,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885515562] [2024-10-14 05:11:15,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885515562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:15,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:15,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:11:15,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523582953] [2024-10-14 05:11:15,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:15,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:11:15,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:15,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:11:15,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:11:15,110 INFO L87 Difference]: Start difference. First operand 1137 states and 1582 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-14 05:11:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:15,644 INFO L93 Difference]: Finished difference Result 1733 states and 2339 transitions. [2024-10-14 05:11:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:11:15,645 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-14 05:11:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:15,650 INFO L225 Difference]: With dead ends: 1733 [2024-10-14 05:11:15,650 INFO L226 Difference]: Without dead ends: 1144 [2024-10-14 05:11:15,653 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-14 05:11:15,653 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 961 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:15,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 765 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-10-14 05:11:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1073. [2024-10-14 05:11:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 952 states have (on average 1.3855042016806722) internal successors, (1319), 967 states have internal predecessors, (1319), 76 states have call successors, (76), 38 states have call predecessors, (76), 43 states have return successors, (99), 68 states have call predecessors, (99), 73 states have call successors, (99) [2024-10-14 05:11:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1494 transitions. [2024-10-14 05:11:15,706 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1494 transitions. Word has length 78 [2024-10-14 05:11:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:15,707 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1494 transitions. [2024-10-14 05:11:15,707 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-14 05:11:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1494 transitions. [2024-10-14 05:11:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 05:11:15,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:15,710 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-14 05:11:15,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:11:15,710 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:15,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1172774086, now seen corresponding path program 1 times [2024-10-14 05:11:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:15,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763482125] [2024-10-14 05:11:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:11:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 05:11:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 05:11:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 05:11:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,791 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-14 05:11:15,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763482125] [2024-10-14 05:11:15,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763482125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:11:15,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363445861] [2024-10-14 05:11:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:15,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:15,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:15,794 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:11:15,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 05:11:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:11:15,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:11:15,907 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-14 05:11:15,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:11:15,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363445861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:15,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:11:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:11:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346445799] [2024-10-14 05:11:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:15,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:11:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:15,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:11:15,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:15,909 INFO L87 Difference]: Start difference. First operand 1073 states and 1494 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-14 05:11:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:16,042 INFO L93 Difference]: Finished difference Result 1354 states and 1843 transitions. [2024-10-14 05:11:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:11:16,042 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-14 05:11:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:16,046 INFO L225 Difference]: With dead ends: 1354 [2024-10-14 05:11:16,046 INFO L226 Difference]: Without dead ends: 375 [2024-10-14 05:11:16,047 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-14 05:11:16,048 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 54 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:16,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1293 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:11:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-14 05:11:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-14 05:11:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 339 states have (on average 1.640117994100295) internal successors, (556), 341 states have internal predecessors, (556), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 05:11:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 612 transitions. [2024-10-14 05:11:16,067 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 612 transitions. Word has length 92 [2024-10-14 05:11:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:16,067 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 612 transitions. [2024-10-14 05:11:16,067 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-14 05:11:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 612 transitions. [2024-10-14 05:11:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:16,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:16,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:16,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 05:11:16,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 05:11:16,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:16,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:16,274 INFO L85 PathProgramCache]: Analyzing trace with hash -734965434, now seen corresponding path program 1 times [2024-10-14 05:11:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:16,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898124605] [2024-10-14 05:11:16,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:16,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898124605] [2024-10-14 05:11:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898124605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:16,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:11:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836128369] [2024-10-14 05:11:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:11:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:11:16,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:11:16,483 INFO L87 Difference]: Start difference. First operand 375 states and 612 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:18,414 INFO L93 Difference]: Finished difference Result 883 states and 1464 transitions. [2024-10-14 05:11:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:11:18,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:18,418 INFO L225 Difference]: With dead ends: 883 [2024-10-14 05:11:18,418 INFO L226 Difference]: Without dead ends: 515 [2024-10-14 05:11:18,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:11:18,420 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1056 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:18,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 680 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 05:11:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-14 05:11:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 375. [2024-10-14 05:11:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 339 states have (on average 1.6371681415929205) internal successors, (555), 341 states have internal predecessors, (555), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 05:11:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 611 transitions. [2024-10-14 05:11:18,444 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 611 transitions. Word has length 172 [2024-10-14 05:11:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:18,445 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 611 transitions. [2024-10-14 05:11:18,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 611 transitions. [2024-10-14 05:11:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:18,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:18,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:11:18,447 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash 989642888, now seen corresponding path program 1 times [2024-10-14 05:11:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584339337] [2024-10-14 05:11:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:18,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:18,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:18,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584339337] [2024-10-14 05:11:18,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584339337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:18,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:18,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:11:18,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77550262] [2024-10-14 05:11:18,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:18,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:11:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:18,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:11:18,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:11:18,705 INFO L87 Difference]: Start difference. First operand 375 states and 611 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:20,704 INFO L93 Difference]: Finished difference Result 875 states and 1447 transitions. [2024-10-14 05:11:20,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:11:20,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:20,708 INFO L225 Difference]: With dead ends: 875 [2024-10-14 05:11:20,709 INFO L226 Difference]: Without dead ends: 515 [2024-10-14 05:11:20,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:11:20,710 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1047 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:20,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 678 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 05:11:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-14 05:11:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 375. [2024-10-14 05:11:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 339 states have (on average 1.6342182890855457) internal successors, (554), 341 states have internal predecessors, (554), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 05:11:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 610 transitions. [2024-10-14 05:11:20,736 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 610 transitions. Word has length 172 [2024-10-14 05:11:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:20,737 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 610 transitions. [2024-10-14 05:11:20,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 610 transitions. [2024-10-14 05:11:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:20,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:20,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:20,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:11:20,739 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:20,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 8688074, now seen corresponding path program 1 times [2024-10-14 05:11:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:20,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028299915] [2024-10-14 05:11:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:20,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:20,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:20,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:21,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028299915] [2024-10-14 05:11:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028299915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:21,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:21,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:21,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929096309] [2024-10-14 05:11:21,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:21,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:21,021 INFO L87 Difference]: Start difference. First operand 375 states and 610 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:23,926 INFO L93 Difference]: Finished difference Result 1386 states and 2306 transitions. [2024-10-14 05:11:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:11:23,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:23,933 INFO L225 Difference]: With dead ends: 1386 [2024-10-14 05:11:23,937 INFO L226 Difference]: Without dead ends: 1031 [2024-10-14 05:11:23,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:23,939 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1597 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:23,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 1147 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 05:11:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-10-14 05:11:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 750. [2024-10-14 05:11:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 685 states have (on average 1.6452554744525547) internal successors, (1127), 688 states have internal predecessors, (1127), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-14 05:11:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1230 transitions. [2024-10-14 05:11:24,009 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1230 transitions. Word has length 172 [2024-10-14 05:11:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:24,010 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1230 transitions. [2024-10-14 05:11:24,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1230 transitions. [2024-10-14 05:11:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:24,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:24,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:24,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:11:24,014 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:24,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:24,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1013793350, now seen corresponding path program 1 times [2024-10-14 05:11:24,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:24,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794242268] [2024-10-14 05:11:24,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:24,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:24,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:24,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794242268] [2024-10-14 05:11:24,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794242268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:24,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:24,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812267936] [2024-10-14 05:11:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:24,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:24,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:24,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:24,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:24,382 INFO L87 Difference]: Start difference. First operand 750 states and 1230 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:28,433 INFO L93 Difference]: Finished difference Result 2297 states and 3828 transitions. [2024-10-14 05:11:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:28,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:28,439 INFO L225 Difference]: With dead ends: 2297 [2024-10-14 05:11:28,440 INFO L226 Difference]: Without dead ends: 1567 [2024-10-14 05:11:28,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:28,441 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 1634 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 4019 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:28,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 2188 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 4019 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 05:11:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-10-14 05:11:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1096. [2024-10-14 05:11:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1002 states have (on average 1.6387225548902196) internal successors, (1642), 1006 states have internal predecessors, (1642), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-14 05:11:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1791 transitions. [2024-10-14 05:11:28,489 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1791 transitions. Word has length 172 [2024-10-14 05:11:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:28,489 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1791 transitions. [2024-10-14 05:11:28,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1791 transitions. [2024-10-14 05:11:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:28,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:28,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:28,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:11:28,491 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:28,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1399655752, now seen corresponding path program 1 times [2024-10-14 05:11:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:28,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799700254] [2024-10-14 05:11:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:28,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:28,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799700254] [2024-10-14 05:11:28,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799700254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:28,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:28,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704943016] [2024-10-14 05:11:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:28,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:28,710 INFO L87 Difference]: Start difference. First operand 1096 states and 1791 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:32,319 INFO L93 Difference]: Finished difference Result 3632 states and 6043 transitions. [2024-10-14 05:11:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:32,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:32,331 INFO L225 Difference]: With dead ends: 3632 [2024-10-14 05:11:32,332 INFO L226 Difference]: Without dead ends: 2556 [2024-10-14 05:11:32,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:32,336 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1632 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 4015 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:32,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 2186 Invalid, 4084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4015 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 05:11:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2024-10-14 05:11:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1789. [2024-10-14 05:11:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1637 states have (on average 1.6328649969456324) internal successors, (2673), 1643 states have internal predecessors, (2673), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-14 05:11:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2918 transitions. [2024-10-14 05:11:32,422 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2918 transitions. Word has length 172 [2024-10-14 05:11:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:32,423 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2918 transitions. [2024-10-14 05:11:32,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2918 transitions. [2024-10-14 05:11:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:32,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:32,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:32,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:11:32,425 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:32,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1135008262, now seen corresponding path program 1 times [2024-10-14 05:11:32,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:32,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197489376] [2024-10-14 05:11:32,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:32,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:32,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197489376] [2024-10-14 05:11:32,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197489376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:32,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:32,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:32,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528269066] [2024-10-14 05:11:32,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:32,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:32,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:32,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:32,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:32,765 INFO L87 Difference]: Start difference. First operand 1789 states and 2918 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:34,790 INFO L93 Difference]: Finished difference Result 4313 states and 7161 transitions. [2024-10-14 05:11:34,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:34,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:34,817 INFO L225 Difference]: With dead ends: 4313 [2024-10-14 05:11:34,817 INFO L226 Difference]: Without dead ends: 2544 [2024-10-14 05:11:34,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:34,826 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1335 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:34,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 944 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:11:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2024-10-14 05:11:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 1789. [2024-10-14 05:11:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1637 states have (on average 1.6298106291997556) internal successors, (2668), 1643 states have internal predecessors, (2668), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-14 05:11:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2913 transitions. [2024-10-14 05:11:35,051 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2913 transitions. Word has length 172 [2024-10-14 05:11:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:35,051 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2913 transitions. [2024-10-14 05:11:35,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2913 transitions. [2024-10-14 05:11:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:35,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:35,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:35,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:11:35,057 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1228833400, now seen corresponding path program 1 times [2024-10-14 05:11:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:35,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930329324] [2024-10-14 05:11:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:35,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:35,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:35,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930329324] [2024-10-14 05:11:35,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930329324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:35,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:35,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:35,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631370895] [2024-10-14 05:11:35,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:35,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:35,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:35,536 INFO L87 Difference]: Start difference. First operand 1789 states and 2913 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:37,957 INFO L93 Difference]: Finished difference Result 4302 states and 7125 transitions. [2024-10-14 05:11:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:37,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:37,982 INFO L225 Difference]: With dead ends: 4302 [2024-10-14 05:11:37,982 INFO L226 Difference]: Without dead ends: 2533 [2024-10-14 05:11:37,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:37,996 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1421 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:37,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 943 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 05:11:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2024-10-14 05:11:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 1789. [2024-10-14 05:11:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1637 states have (on average 1.626756261453879) internal successors, (2663), 1643 states have internal predecessors, (2663), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-14 05:11:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2908 transitions. [2024-10-14 05:11:38,193 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2908 transitions. Word has length 172 [2024-10-14 05:11:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:38,193 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2908 transitions. [2024-10-14 05:11:38,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2908 transitions. [2024-10-14 05:11:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:38,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:38,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:38,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:11:38,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:38,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 668146058, now seen corresponding path program 1 times [2024-10-14 05:11:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:38,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344652231] [2024-10-14 05:11:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344652231] [2024-10-14 05:11:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344652231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:38,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:38,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:38,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21638092] [2024-10-14 05:11:38,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:38,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:38,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:38,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:38,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:38,439 INFO L87 Difference]: Start difference. First operand 1789 states and 2908 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:42,450 INFO L93 Difference]: Finished difference Result 6172 states and 10184 transitions. [2024-10-14 05:11:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:42,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:42,463 INFO L225 Difference]: With dead ends: 6172 [2024-10-14 05:11:42,463 INFO L226 Difference]: Without dead ends: 4403 [2024-10-14 05:11:42,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:42,467 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1619 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 3933 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:42,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 2186 Invalid, 4002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3933 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 05:11:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2024-10-14 05:11:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 3190. [2024-10-14 05:11:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 2922 states have (on average 1.621492128678987) internal successors, (4738), 2932 states have internal predecessors, (4738), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-14 05:11:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 5181 transitions. [2024-10-14 05:11:42,627 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 5181 transitions. Word has length 172 [2024-10-14 05:11:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:42,628 INFO L471 AbstractCegarLoop]: Abstraction has 3190 states and 5181 transitions. [2024-10-14 05:11:42,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 5181 transitions. [2024-10-14 05:11:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:42,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:42,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:42,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:11:42,630 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:42,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1006433608, now seen corresponding path program 1 times [2024-10-14 05:11:42,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:42,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299693809] [2024-10-14 05:11:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:42,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299693809] [2024-10-14 05:11:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299693809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:42,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173263768] [2024-10-14 05:11:42,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:42,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:42,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:42,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:42,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:42,868 INFO L87 Difference]: Start difference. First operand 3190 states and 5181 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:44,976 INFO L93 Difference]: Finished difference Result 7600 states and 12538 transitions. [2024-10-14 05:11:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:44,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:45,016 INFO L225 Difference]: With dead ends: 7600 [2024-10-14 05:11:45,020 INFO L226 Difference]: Without dead ends: 4430 [2024-10-14 05:11:45,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:45,032 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1166 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:45,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1122 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 05:11:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2024-10-14 05:11:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 3190. [2024-10-14 05:11:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 2922 states have (on average 1.6184120465434635) internal successors, (4729), 2932 states have internal predecessors, (4729), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-14 05:11:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 5172 transitions. [2024-10-14 05:11:45,259 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 5172 transitions. Word has length 172 [2024-10-14 05:11:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:45,260 INFO L471 AbstractCegarLoop]: Abstraction has 3190 states and 5172 transitions. [2024-10-14 05:11:45,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 5172 transitions. [2024-10-14 05:11:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:45,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:45,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:45,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:11:45,263 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:45,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1432988106, now seen corresponding path program 1 times [2024-10-14 05:11:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:45,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195399249] [2024-10-14 05:11:45,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:45,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:45,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:45,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195399249] [2024-10-14 05:11:45,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195399249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:45,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:45,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:45,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322543735] [2024-10-14 05:11:45,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:45,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:45,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:45,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:45,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:45,567 INFO L87 Difference]: Start difference. First operand 3190 states and 5172 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:49,968 INFO L93 Difference]: Finished difference Result 11279 states and 18537 transitions. [2024-10-14 05:11:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:49,990 INFO L225 Difference]: With dead ends: 11279 [2024-10-14 05:11:49,991 INFO L226 Difference]: Without dead ends: 8109 [2024-10-14 05:11:49,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:49,997 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1611 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 3895 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 3964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:49,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 2186 Invalid, 3964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3895 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 05:11:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8109 states. [2024-10-14 05:11:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8109 to 6002. [2024-10-14 05:11:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6002 states, 5502 states have (on average 1.613776808433297) internal successors, (8879), 5520 states have internal predecessors, (8879), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-14 05:11:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6002 states to 6002 states and 9736 transitions. [2024-10-14 05:11:50,542 INFO L78 Accepts]: Start accepts. Automaton has 6002 states and 9736 transitions. Word has length 172 [2024-10-14 05:11:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:50,542 INFO L471 AbstractCegarLoop]: Abstraction has 6002 states and 9736 transitions. [2024-10-14 05:11:50,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6002 states and 9736 transitions. [2024-10-14 05:11:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:50,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:50,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:50,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:11:50,547 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:50,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash 892558600, now seen corresponding path program 1 times [2024-10-14 05:11:50,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:50,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003261387] [2024-10-14 05:11:50,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003261387] [2024-10-14 05:11:50,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003261387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:50,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:50,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244836462] [2024-10-14 05:11:50,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:50,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:50,856 INFO L87 Difference]: Start difference. First operand 6002 states and 9736 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:54,877 INFO L93 Difference]: Finished difference Result 21509 states and 35375 transitions. [2024-10-14 05:11:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:54,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:11:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:54,917 INFO L225 Difference]: With dead ends: 21509 [2024-10-14 05:11:54,917 INFO L226 Difference]: Without dead ends: 15527 [2024-10-14 05:11:54,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:54,932 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1610 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 3882 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 3951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:54,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 2186 Invalid, 3951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3882 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 05:11:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15527 states. [2024-10-14 05:11:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15527 to 11639. [2024-10-14 05:11:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11639 states, 10675 states have (on average 1.61096018735363) internal successors, (17197), 10709 states have internal predecessors, (17197), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-14 05:11:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11639 states to 11639 states and 18936 transitions. [2024-10-14 05:11:55,763 INFO L78 Accepts]: Start accepts. Automaton has 11639 states and 18936 transitions. Word has length 172 [2024-10-14 05:11:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:55,764 INFO L471 AbstractCegarLoop]: Abstraction has 11639 states and 18936 transitions. [2024-10-14 05:11:55,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 11639 states and 18936 transitions. [2024-10-14 05:11:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:11:55,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:55,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:55,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 05:11:55,772 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:55,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:55,772 INFO L85 PathProgramCache]: Analyzing trace with hash 736578058, now seen corresponding path program 1 times [2024-10-14 05:11:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:55,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694656319] [2024-10-14 05:11:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:11:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:11:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:11:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:11:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694656319] [2024-10-14 05:11:56,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694656319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:56,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:56,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:56,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87583129] [2024-10-14 05:11:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:56,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:56,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:56,104 INFO L87 Difference]: Start difference. First operand 11639 states and 18936 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:01,802 INFO L93 Difference]: Finished difference Result 41968 states and 69241 transitions. [2024-10-14 05:12:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:12:01,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:12:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:01,883 INFO L225 Difference]: With dead ends: 41968 [2024-10-14 05:12:01,883 INFO L226 Difference]: Without dead ends: 30349 [2024-10-14 05:12:01,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:12:01,909 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 1609 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 3869 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 3938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:01,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 2186 Invalid, 3938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3869 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 05:12:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30349 states. [2024-10-14 05:12:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30349 to 22944. [2024-10-14 05:12:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22944 states, 21052 states have (on average 1.6093007790233707) internal successors, (33879), 21118 states have internal predecessors, (33879), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-10-14 05:12:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22944 states to 22944 states and 37544 transitions. [2024-10-14 05:12:03,788 INFO L78 Accepts]: Start accepts. Automaton has 22944 states and 37544 transitions. Word has length 172 [2024-10-14 05:12:03,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:03,788 INFO L471 AbstractCegarLoop]: Abstraction has 22944 states and 37544 transitions. [2024-10-14 05:12:03,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 22944 states and 37544 transitions. [2024-10-14 05:12:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:12:03,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:03,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:03,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 05:12:03,797 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1147188424, now seen corresponding path program 1 times [2024-10-14 05:12:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710631925] [2024-10-14 05:12:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:12:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:12:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:12:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:12:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:12:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710631925] [2024-10-14 05:12:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710631925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:03,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249587127] [2024-10-14 05:12:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:03,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:03,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:03,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:03,997 INFO L87 Difference]: Start difference. First operand 22944 states and 37544 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:08,613 INFO L93 Difference]: Finished difference Result 53764 states and 89477 transitions. [2024-10-14 05:12:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:12:08,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:12:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:08,709 INFO L225 Difference]: With dead ends: 53764 [2024-10-14 05:12:08,709 INFO L226 Difference]: Without dead ends: 30840 [2024-10-14 05:12:08,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:12:08,757 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1172 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:08,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 1122 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 05:12:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30840 states. [2024-10-14 05:12:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30840 to 22944. [2024-10-14 05:12:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22944 states, 21052 states have (on average 1.606213186395592) internal successors, (33814), 21118 states have internal predecessors, (33814), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-10-14 05:12:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22944 states to 22944 states and 37479 transitions. [2024-10-14 05:12:11,298 INFO L78 Accepts]: Start accepts. Automaton has 22944 states and 37479 transitions. Word has length 172 [2024-10-14 05:12:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:11,299 INFO L471 AbstractCegarLoop]: Abstraction has 22944 states and 37479 transitions. [2024-10-14 05:12:11,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 22944 states and 37479 transitions. [2024-10-14 05:12:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:12:11,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:11,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:11,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 05:12:11,317 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:11,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash -640681398, now seen corresponding path program 1 times [2024-10-14 05:12:11,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:11,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930661063] [2024-10-14 05:12:11,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:11,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:12:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:11,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:12:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:11,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:12:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:12:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:12:11,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:11,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930661063] [2024-10-14 05:12:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930661063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:11,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:11,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159044864] [2024-10-14 05:12:11,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:11,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:11,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:11,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:11,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:11,662 INFO L87 Difference]: Start difference. First operand 22944 states and 37479 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:19,627 INFO L93 Difference]: Finished difference Result 82755 states and 136987 transitions. [2024-10-14 05:12:19,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:12:19,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-14 05:12:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:19,808 INFO L225 Difference]: With dead ends: 82755 [2024-10-14 05:12:19,808 INFO L226 Difference]: Without dead ends: 59831 [2024-10-14 05:12:19,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:12:19,881 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1705 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 3195 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:19,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 1416 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3195 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 05:12:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59831 states. [2024-10-14 05:12:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59831 to 45747. [2024-10-14 05:12:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45747 states, 41999 states have (on average 1.6048953546513012) internal successors, (67404), 42129 states have internal predecessors, (67404), 2845 states have call successors, (2845), 775 states have call predecessors, (2845), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-10-14 05:12:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45747 states to 45747 states and 75407 transitions. [2024-10-14 05:12:24,081 INFO L78 Accepts]: Start accepts. Automaton has 45747 states and 75407 transitions. Word has length 172 [2024-10-14 05:12:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:24,081 INFO L471 AbstractCegarLoop]: Abstraction has 45747 states and 75407 transitions. [2024-10-14 05:12:24,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 45747 states and 75407 transitions. [2024-10-14 05:12:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 05:12:24,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:24,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:24,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 05:12:24,107 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:24,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash -571033524, now seen corresponding path program 1 times [2024-10-14 05:12:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:24,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145002945] [2024-10-14 05:12:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:12:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 05:12:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 05:12:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 05:12:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:12:24,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:24,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145002945] [2024-10-14 05:12:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145002945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:24,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:24,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:24,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950454498] [2024-10-14 05:12:24,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:24,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:24,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:24,493 INFO L87 Difference]: Start difference. First operand 45747 states and 75407 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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)