./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_2.cil-1+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b411c6ac71505d2c5059a06fd3211eebca89561d9ac8be37f9ecc9ff82a7a16 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:03:15,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:03:15,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:03:15,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:03:15,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:03:16,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:03:16,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:03:16,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:03:16,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:03:16,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:03:16,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:03:16,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:03:16,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:03:16,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:03:16,019 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:03:16,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:03:16,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:03:16,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:03:16,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:03:16,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:03:16,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:03:16,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:03:16,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:03:16,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:03:16,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:03:16,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:03:16,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:03:16,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:03:16,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:03:16,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:03:16,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:03:16,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:03:16,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:03:16,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:03:16,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:03:16,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:03:16,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:03:16,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:03:16,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:03:16,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:03:16,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:03:16,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:03:16,030 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b411c6ac71505d2c5059a06fd3211eebca89561d9ac8be37f9ecc9ff82a7a16 [2024-10-11 05:03:16,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:03:16,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:03:16,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:03:16,235 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:03:16,235 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:03:16,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2024-10-11 05:03:17,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:03:17,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:03:17,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2024-10-11 05:03:17,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ada0e90d2/176e74f767774d2aa3ba1db856026509/FLAG9d230601d [2024-10-11 05:03:18,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ada0e90d2/176e74f767774d2aa3ba1db856026509 [2024-10-11 05:03:18,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:03:18,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:03:18,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:03:18,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:03:18,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:03:18,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aeaba80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18, skipping insertion in model container [2024-10-11 05:03:18,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:03:18,242 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_2.cil-1+token_ring.05.cil-2.c[914,927] [2024-10-11 05:03:18,285 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_2.cil-1+token_ring.05.cil-2.c[7115,7128] [2024-10-11 05:03:18,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:03:18,350 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:03:18,366 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_2.cil-1+token_ring.05.cil-2.c[914,927] [2024-10-11 05:03:18,377 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_2.cil-1+token_ring.05.cil-2.c[7115,7128] [2024-10-11 05:03:18,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:03:18,418 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:03:18,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18 WrapperNode [2024-10-11 05:03:18,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:03:18,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:03:18,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:03:18,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:03:18,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,461 INFO L138 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 654 [2024-10-11 05:03:18,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:03:18,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:03:18,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:03:18,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:03:18,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,492 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:03:18,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:03:18,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:03:18,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:03:18,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:03:18,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (1/1) ... [2024-10-11 05:03:18,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:03:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:18,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:03:18,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:03:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:03:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:03:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:03:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:03:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:03:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:03:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:03:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:03:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:03:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:03:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:03:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:03:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:03:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:03:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:03:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:03:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:03:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:03:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:03:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:03:18,591 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:03:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:03:18,591 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:03:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:03:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:03:18,591 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:03:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:03:18,591 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:03:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:03:18,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:03:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:03:18,591 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:03:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:03:18,591 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:03:18,668 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:03:18,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:03:19,229 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-11 05:03:19,229 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:03:19,285 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:03:19,286 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-11 05:03:19,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:03:19 BoogieIcfgContainer [2024-10-11 05:03:19,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:03:19,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:03:19,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:03:19,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:03:19,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:03:18" (1/3) ... [2024-10-11 05:03:19,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e158a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:03:19, skipping insertion in model container [2024-10-11 05:03:19,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:18" (2/3) ... [2024-10-11 05:03:19,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e158a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:03:19, skipping insertion in model container [2024-10-11 05:03:19,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:03:19" (3/3) ... [2024-10-11 05:03:19,295 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2024-10-11 05:03:19,308 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:03:19,308 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:03:19,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:03:19,372 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;@fae8db2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:03:19,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:03:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 241 states have internal predecessors, (392), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:03:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:19,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:19,391 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] [2024-10-11 05:03:19,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:19,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1937458787, now seen corresponding path program 1 times [2024-10-11 05:03:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112311588] [2024-10-11 05:03:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:19,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:19,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:19,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112311588] [2024-10-11 05:03:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112311588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951542202] [2024-10-11 05:03:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:19,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:19,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:19,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:19,754 INFO L87 Difference]: Start difference. First operand has 286 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 241 states have internal predecessors, (392), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:20,388 INFO L93 Difference]: Finished difference Result 571 states and 920 transitions. [2024-10-11 05:03:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:03:20,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:03:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:20,404 INFO L225 Difference]: With dead ends: 571 [2024-10-11 05:03:20,405 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 05:03:20,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:20,413 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 603 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:20,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 719 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 05:03:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 280. [2024-10-11 05:03:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 230 states have (on average 1.565217391304348) internal successors, (360), 235 states have internal predecessors, (360), 35 states have call successors, (35), 15 states have call predecessors, (35), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 05:03:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 426 transitions. [2024-10-11 05:03:20,465 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 426 transitions. Word has length 58 [2024-10-11 05:03:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:20,465 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 426 transitions. [2024-10-11 05:03:20,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 426 transitions. [2024-10-11 05:03:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:20,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:20,471 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] [2024-10-11 05:03:20,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:03:20,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:20,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1876428251, now seen corresponding path program 1 times [2024-10-11 05:03:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:20,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309219540] [2024-10-11 05:03:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:20,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:20,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:20,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:20,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:20,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:20,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309219540] [2024-10-11 05:03:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309219540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:20,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130348669] [2024-10-11 05:03:20,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:20,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:20,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:20,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:20,682 INFO L87 Difference]: Start difference. First operand 280 states and 426 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:21,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:21,462 INFO L93 Difference]: Finished difference Result 486 states and 723 transitions. [2024-10-11 05:03:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:03:21,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:03:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:21,469 INFO L225 Difference]: With dead ends: 486 [2024-10-11 05:03:21,469 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 05:03:21,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:21,471 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 538 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:21,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1284 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 05:03:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 368. [2024-10-11 05:03:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 298 states have (on average 1.5302013422818792) internal successors, (456), 305 states have internal predecessors, (456), 46 states have call successors, (46), 22 states have call predecessors, (46), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2024-10-11 05:03:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 549 transitions. [2024-10-11 05:03:21,509 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 549 transitions. Word has length 58 [2024-10-11 05:03:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:21,510 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 549 transitions. [2024-10-11 05:03:21,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 549 transitions. [2024-10-11 05:03:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:21,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:21,512 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] [2024-10-11 05:03:21,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:03:21,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:21,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2010661915, now seen corresponding path program 1 times [2024-10-11 05:03:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:21,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91272709] [2024-10-11 05:03:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:21,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:21,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:21,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91272709] [2024-10-11 05:03:21,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91272709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:21,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:21,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561509053] [2024-10-11 05:03:21,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:21,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:21,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:21,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:21,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:21,691 INFO L87 Difference]: Start difference. First operand 368 states and 549 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:22,535 INFO L93 Difference]: Finished difference Result 688 states and 998 transitions. [2024-10-11 05:03:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:03:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:03:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:22,541 INFO L225 Difference]: With dead ends: 688 [2024-10-11 05:03:22,541 INFO L226 Difference]: Without dead ends: 526 [2024-10-11 05:03:22,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:03:22,544 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 1004 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:22,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1148 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:03:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-11 05:03:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 456. [2024-10-11 05:03:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 366 states have (on average 1.505464480874317) internal successors, (551), 375 states have internal predecessors, (551), 57 states have call successors, (57), 29 states have call predecessors, (57), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2024-10-11 05:03:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 674 transitions. [2024-10-11 05:03:22,595 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 674 transitions. Word has length 58 [2024-10-11 05:03:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:22,595 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 674 transitions. [2024-10-11 05:03:22,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 674 transitions. [2024-10-11 05:03:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:22,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:22,601 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] [2024-10-11 05:03:22,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:03:22,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:22,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:22,602 INFO L85 PathProgramCache]: Analyzing trace with hash -82389213, now seen corresponding path program 1 times [2024-10-11 05:03:22,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:22,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653921595] [2024-10-11 05:03:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:22,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:22,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:22,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653921595] [2024-10-11 05:03:22,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653921595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:22,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:22,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:22,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523131914] [2024-10-11 05:03:22,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:22,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:22,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:22,739 INFO L87 Difference]: Start difference. First operand 456 states and 674 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:23,477 INFO L93 Difference]: Finished difference Result 730 states and 1060 transitions. [2024-10-11 05:03:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-11 05:03:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:23,481 INFO L225 Difference]: With dead ends: 730 [2024-10-11 05:03:23,481 INFO L226 Difference]: Without dead ends: 486 [2024-10-11 05:03:23,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:03:23,482 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 346 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:23,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1548 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-11 05:03:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 460. [2024-10-11 05:03:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 369 states have (on average 1.4959349593495934) internal successors, (552), 378 states have internal predecessors, (552), 57 states have call successors, (57), 29 states have call predecessors, (57), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2024-10-11 05:03:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 676 transitions. [2024-10-11 05:03:23,510 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 676 transitions. Word has length 58 [2024-10-11 05:03:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:23,511 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 676 transitions. [2024-10-11 05:03:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 676 transitions. [2024-10-11 05:03:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:23,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:23,513 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] [2024-10-11 05:03:23,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:03:23,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:23,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1968594785, now seen corresponding path program 1 times [2024-10-11 05:03:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:23,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271298442] [2024-10-11 05:03:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:23,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271298442] [2024-10-11 05:03:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271298442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:23,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:23,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912909375] [2024-10-11 05:03:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:23,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:23,606 INFO L87 Difference]: Start difference. First operand 460 states and 676 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:24,346 INFO L93 Difference]: Finished difference Result 748 states and 1078 transitions. [2024-10-11 05:03:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:03:24,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-11 05:03:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:24,349 INFO L225 Difference]: With dead ends: 748 [2024-10-11 05:03:24,349 INFO L226 Difference]: Without dead ends: 500 [2024-10-11 05:03:24,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:24,350 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 349 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:24,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1546 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-10-11 05:03:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 472. [2024-10-11 05:03:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 378 states have (on average 1.4841269841269842) internal successors, (561), 387 states have internal predecessors, (561), 57 states have call successors, (57), 29 states have call predecessors, (57), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2024-10-11 05:03:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 688 transitions. [2024-10-11 05:03:24,372 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 688 transitions. Word has length 58 [2024-10-11 05:03:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:24,372 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 688 transitions. [2024-10-11 05:03:24,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 688 transitions. [2024-10-11 05:03:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:24,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:24,373 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] [2024-10-11 05:03:24,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:03:24,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:24,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:24,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2030634399, now seen corresponding path program 1 times [2024-10-11 05:03:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:24,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307139960] [2024-10-11 05:03:24,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:24,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:24,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307139960] [2024-10-11 05:03:24,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307139960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:24,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:24,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141057480] [2024-10-11 05:03:24,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:24,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:24,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:24,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:24,488 INFO L87 Difference]: Start difference. First operand 472 states and 688 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:25,251 INFO L93 Difference]: Finished difference Result 828 states and 1163 transitions. [2024-10-11 05:03:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:03:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:03:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:25,254 INFO L225 Difference]: With dead ends: 828 [2024-10-11 05:03:25,254 INFO L226 Difference]: Without dead ends: 570 [2024-10-11 05:03:25,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:03:25,255 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1028 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:25,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 980 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-11 05:03:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 482. [2024-10-11 05:03:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 386 states have (on average 1.4740932642487046) internal successors, (569), 395 states have internal predecessors, (569), 58 states have call successors, (58), 30 states have call predecessors, (58), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2024-10-11 05:03:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 696 transitions. [2024-10-11 05:03:25,277 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 696 transitions. Word has length 58 [2024-10-11 05:03:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:25,278 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 696 transitions. [2024-10-11 05:03:25,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 696 transitions. [2024-10-11 05:03:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:25,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:25,280 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] [2024-10-11 05:03:25,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:03:25,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1841631071, now seen corresponding path program 1 times [2024-10-11 05:03:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560505393] [2024-10-11 05:03:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560505393] [2024-10-11 05:03:25,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560505393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:25,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:25,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814509663] [2024-10-11 05:03:25,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:25,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:25,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:25,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:25,365 INFO L87 Difference]: Start difference. First operand 482 states and 696 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:25,912 INFO L93 Difference]: Finished difference Result 1064 states and 1480 transitions. [2024-10-11 05:03:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:03:25,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:03:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:25,917 INFO L225 Difference]: With dead ends: 1064 [2024-10-11 05:03:25,917 INFO L226 Difference]: Without dead ends: 797 [2024-10-11 05:03:25,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:03:25,918 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1013 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:25,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 770 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-11 05:03:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 743. [2024-10-11 05:03:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 581 states have (on average 1.4182444061962134) internal successors, (824), 597 states have internal predecessors, (824), 93 states have call successors, (93), 52 states have call predecessors, (93), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2024-10-11 05:03:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1043 transitions. [2024-10-11 05:03:25,962 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1043 transitions. Word has length 58 [2024-10-11 05:03:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:25,963 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1043 transitions. [2024-10-11 05:03:25,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1043 transitions. [2024-10-11 05:03:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:03:25,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:25,965 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] [2024-10-11 05:03:25,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:03:25,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:25,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash 96612606, now seen corresponding path program 1 times [2024-10-11 05:03:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637970724] [2024-10-11 05:03:25,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:25,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:26,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:26,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637970724] [2024-10-11 05:03:26,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637970724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:26,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:26,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478654186] [2024-10-11 05:03:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:26,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:26,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:26,033 INFO L87 Difference]: Start difference. First operand 743 states and 1043 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:26,528 INFO L93 Difference]: Finished difference Result 1827 states and 2489 transitions. [2024-10-11 05:03:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:03:26,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-11 05:03:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:26,534 INFO L225 Difference]: With dead ends: 1827 [2024-10-11 05:03:26,534 INFO L226 Difference]: Without dead ends: 1308 [2024-10-11 05:03:26,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:03:26,536 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 1013 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:26,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 625 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-10-11 05:03:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1154. [2024-10-11 05:03:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 892 states have (on average 1.3721973094170403) internal successors, (1224), 915 states have internal predecessors, (1224), 142 states have call successors, (142), 94 states have call predecessors, (142), 118 states have return successors, (196), 151 states have call predecessors, (196), 138 states have call successors, (196) [2024-10-11 05:03:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1562 transitions. [2024-10-11 05:03:26,634 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1562 transitions. Word has length 59 [2024-10-11 05:03:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:26,634 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1562 transitions. [2024-10-11 05:03:26,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1562 transitions. [2024-10-11 05:03:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:03:26,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:26,635 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] [2024-10-11 05:03:26,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:03:26,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:26,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash -211387079, now seen corresponding path program 1 times [2024-10-11 05:03:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:26,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041031735] [2024-10-11 05:03:26,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:26,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041031735] [2024-10-11 05:03:26,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041031735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:26,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:26,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886597123] [2024-10-11 05:03:26,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:26,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:26,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:26,693 INFO L87 Difference]: Start difference. First operand 1154 states and 1562 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:27,237 INFO L93 Difference]: Finished difference Result 3114 states and 4121 transitions. [2024-10-11 05:03:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-11 05:03:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:27,246 INFO L225 Difference]: With dead ends: 3114 [2024-10-11 05:03:27,246 INFO L226 Difference]: Without dead ends: 2154 [2024-10-11 05:03:27,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:27,249 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 527 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:27,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 910 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2024-10-11 05:03:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1970. [2024-10-11 05:03:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1510 states have (on average 1.3364238410596025) internal successors, (2018), 1539 states have internal predecessors, (2018), 236 states have call successors, (236), 180 states have call predecessors, (236), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2024-10-11 05:03:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2588 transitions. [2024-10-11 05:03:27,369 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2588 transitions. Word has length 60 [2024-10-11 05:03:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:27,369 INFO L471 AbstractCegarLoop]: Abstraction has 1970 states and 2588 transitions. [2024-10-11 05:03:27,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2588 transitions. [2024-10-11 05:03:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 05:03:27,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:27,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:27,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:03:27,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:27,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash 630938584, now seen corresponding path program 1 times [2024-10-11 05:03:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541414046] [2024-10-11 05:03:27,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:27,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:27,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541414046] [2024-10-11 05:03:27,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541414046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:27,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:27,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501600827] [2024-10-11 05:03:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:27,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:27,429 INFO L87 Difference]: Start difference. First operand 1970 states and 2588 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:28,034 INFO L93 Difference]: Finished difference Result 4634 states and 5992 transitions. [2024-10-11 05:03:28,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:28,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-11 05:03:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:28,045 INFO L225 Difference]: With dead ends: 4634 [2024-10-11 05:03:28,045 INFO L226 Difference]: Without dead ends: 2878 [2024-10-11 05:03:28,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:28,048 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 796 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:28,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 810 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2024-10-11 05:03:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2636. [2024-10-11 05:03:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2012 states have (on average 1.320079522862823) internal successors, (2656), 2049 states have internal predecessors, (2656), 316 states have call successors, (316), 250 states have call predecessors, (316), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2024-10-11 05:03:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3415 transitions. [2024-10-11 05:03:28,211 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3415 transitions. Word has length 66 [2024-10-11 05:03:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:28,211 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3415 transitions. [2024-10-11 05:03:28,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3415 transitions. [2024-10-11 05:03:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 05:03:28,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:28,213 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:28,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:03:28,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:28,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:28,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1862777236, now seen corresponding path program 1 times [2024-10-11 05:03:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:28,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681111414] [2024-10-11 05:03:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:28,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:28,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681111414] [2024-10-11 05:03:28,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681111414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:28,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:28,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050172005] [2024-10-11 05:03:28,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:28,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:28,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:28,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:28,278 INFO L87 Difference]: Start difference. First operand 2636 states and 3415 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:28,950 INFO L93 Difference]: Finished difference Result 3356 states and 4292 transitions. [2024-10-11 05:03:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:03:28,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-11 05:03:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:28,962 INFO L225 Difference]: With dead ends: 3356 [2024-10-11 05:03:28,962 INFO L226 Difference]: Without dead ends: 3353 [2024-10-11 05:03:28,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:03:28,964 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 1214 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:28,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 784 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2024-10-11 05:03:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3086. [2024-10-11 05:03:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2353 states have (on average 1.3106672333191671) internal successors, (3084), 2395 states have internal predecessors, (3084), 366 states have call successors, (366), 294 states have call predecessors, (366), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2024-10-11 05:03:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 3972 transitions. [2024-10-11 05:03:29,232 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 3972 transitions. Word has length 67 [2024-10-11 05:03:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:29,233 INFO L471 AbstractCegarLoop]: Abstraction has 3086 states and 3972 transitions. [2024-10-11 05:03:29,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 3972 transitions. [2024-10-11 05:03:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 05:03:29,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:29,234 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:29,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:03:29,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:29,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1910565794, now seen corresponding path program 1 times [2024-10-11 05:03:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:29,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608030946] [2024-10-11 05:03:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:29,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608030946] [2024-10-11 05:03:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608030946] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647390263] [2024-10-11 05:03:29,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:29,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:29,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:29,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:29,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:03:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:03:29,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:29,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:03:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647390263] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:03:29,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:03:29,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-11 05:03:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653652902] [2024-10-11 05:03:29,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:03:29,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:03:29,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:29,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:03:29,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:29,660 INFO L87 Difference]: Start difference. First operand 3086 states and 3972 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:03:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:31,125 INFO L93 Difference]: Finished difference Result 7153 states and 9084 transitions. [2024-10-11 05:03:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 05:03:31,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-10-11 05:03:31,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:31,151 INFO L225 Difference]: With dead ends: 7153 [2024-10-11 05:03:31,151 INFO L226 Difference]: Without dead ends: 7150 [2024-10-11 05:03:31,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-11 05:03:31,154 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1836 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:31,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 1407 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2024-10-11 05:03:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 4712. [2024-10-11 05:03:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 3593 states have (on average 1.3069858057333705) internal successors, (4696), 3657 states have internal predecessors, (4696), 550 states have call successors, (550), 452 states have call predecessors, (550), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2024-10-11 05:03:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6046 transitions. [2024-10-11 05:03:31,629 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6046 transitions. Word has length 68 [2024-10-11 05:03:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:31,630 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 6046 transitions. [2024-10-11 05:03:31,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:03:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6046 transitions. [2024-10-11 05:03:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:31,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:31,632 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:31,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 05:03:31,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 05:03:31,837 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:31,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash -386332780, now seen corresponding path program 2 times [2024-10-11 05:03:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:31,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422927499] [2024-10-11 05:03:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:31,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:31,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:31,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422927499] [2024-10-11 05:03:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422927499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:31,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75274705] [2024-10-11 05:03:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:31,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:31,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:31,894 INFO L87 Difference]: Start difference. First operand 4712 states and 6046 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:32,537 INFO L93 Difference]: Finished difference Result 7168 states and 9193 transitions. [2024-10-11 05:03:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:03:32,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2024-10-11 05:03:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:32,552 INFO L225 Difference]: With dead ends: 7168 [2024-10-11 05:03:32,552 INFO L226 Difference]: Without dead ends: 3465 [2024-10-11 05:03:32,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:32,559 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 724 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:32,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 878 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:32,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2024-10-11 05:03:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3236. [2024-10-11 05:03:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 2473 states have (on average 1.289122523251112) internal successors, (3188), 2515 states have internal predecessors, (3188), 382 states have call successors, (382), 308 states have call predecessors, (382), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2024-10-11 05:03:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4096 transitions. [2024-10-11 05:03:32,824 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4096 transitions. Word has length 71 [2024-10-11 05:03:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:32,824 INFO L471 AbstractCegarLoop]: Abstraction has 3236 states and 4096 transitions. [2024-10-11 05:03:32,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4096 transitions. [2024-10-11 05:03:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 05:03:32,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:32,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:32,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:03:32,830 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:32,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:32,830 INFO L85 PathProgramCache]: Analyzing trace with hash 492720875, now seen corresponding path program 1 times [2024-10-11 05:03:32,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:32,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624567330] [2024-10-11 05:03:32,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:03:32,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:32,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624567330] [2024-10-11 05:03:32,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624567330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:32,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:32,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:32,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288024626] [2024-10-11 05:03:32,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:32,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:32,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:32,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:32,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:32,928 INFO L87 Difference]: Start difference. First operand 3236 states and 4096 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:34,314 INFO L93 Difference]: Finished difference Result 9518 states and 11903 transitions. [2024-10-11 05:03:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 05:03:34,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-11 05:03:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:34,336 INFO L225 Difference]: With dead ends: 9518 [2024-10-11 05:03:34,336 INFO L226 Difference]: Without dead ends: 5297 [2024-10-11 05:03:34,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-11 05:03:34,344 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 956 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:34,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1205 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2024-10-11 05:03:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 4977. [2024-10-11 05:03:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4977 states, 3757 states have (on average 1.2619110992813416) internal successors, (4741), 3842 states have internal predecessors, (4741), 586 states have call successors, (586), 482 states have call predecessors, (586), 632 states have return successors, (908), 659 states have call predecessors, (908), 583 states have call successors, (908) [2024-10-11 05:03:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6235 transitions. [2024-10-11 05:03:34,762 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6235 transitions. Word has length 76 [2024-10-11 05:03:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:34,762 INFO L471 AbstractCegarLoop]: Abstraction has 4977 states and 6235 transitions. [2024-10-11 05:03:34,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6235 transitions. [2024-10-11 05:03:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 05:03:34,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:34,766 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:34,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:03:34,766 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:34,767 INFO L85 PathProgramCache]: Analyzing trace with hash 533862617, now seen corresponding path program 1 times [2024-10-11 05:03:34,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:34,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501806543] [2024-10-11 05:03:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:34,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:03:34,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:34,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501806543] [2024-10-11 05:03:34,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501806543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:34,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:34,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:34,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553332193] [2024-10-11 05:03:34,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:34,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:34,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:34,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:34,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:34,937 INFO L87 Difference]: Start difference. First operand 4977 states and 6235 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:36,103 INFO L93 Difference]: Finished difference Result 8648 states and 10743 transitions. [2024-10-11 05:03:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 05:03:36,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-11 05:03:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:36,118 INFO L225 Difference]: With dead ends: 8648 [2024-10-11 05:03:36,118 INFO L226 Difference]: Without dead ends: 4468 [2024-10-11 05:03:36,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-11 05:03:36,125 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 1623 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:36,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 1044 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2024-10-11 05:03:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 4134. [2024-10-11 05:03:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4134 states, 3127 states have (on average 1.253917492804605) internal successors, (3921), 3194 states have internal predecessors, (3921), 487 states have call successors, (487), 397 states have call predecessors, (487), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-10-11 05:03:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4134 states to 4134 states and 5094 transitions. [2024-10-11 05:03:36,457 INFO L78 Accepts]: Start accepts. Automaton has 4134 states and 5094 transitions. Word has length 86 [2024-10-11 05:03:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:36,457 INFO L471 AbstractCegarLoop]: Abstraction has 4134 states and 5094 transitions. [2024-10-11 05:03:36,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4134 states and 5094 transitions. [2024-10-11 05:03:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:36,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:36,460 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] [2024-10-11 05:03:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:03:36,460 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1696227257, now seen corresponding path program 1 times [2024-10-11 05:03:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020202176] [2024-10-11 05:03:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:36,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:36,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020202176] [2024-10-11 05:03:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020202176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:36,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:36,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:03:36,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995514226] [2024-10-11 05:03:36,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:36,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:03:36,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:36,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:03:36,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:03:36,527 INFO L87 Difference]: Start difference. First operand 4134 states and 5094 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:37,831 INFO L93 Difference]: Finished difference Result 4378 states and 5490 transitions. [2024-10-11 05:03:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:37,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:37,845 INFO L225 Difference]: With dead ends: 4378 [2024-10-11 05:03:37,845 INFO L226 Difference]: Without dead ends: 4194 [2024-10-11 05:03:37,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:37,847 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 588 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:37,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 572 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2024-10-11 05:03:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 4134. [2024-10-11 05:03:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4134 states, 3127 states have (on average 1.253597697473617) internal successors, (3920), 3194 states have internal predecessors, (3920), 487 states have call successors, (487), 397 states have call predecessors, (487), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-10-11 05:03:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4134 states to 4134 states and 5093 transitions. [2024-10-11 05:03:38,353 INFO L78 Accepts]: Start accepts. Automaton has 4134 states and 5093 transitions. Word has length 92 [2024-10-11 05:03:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:38,353 INFO L471 AbstractCegarLoop]: Abstraction has 4134 states and 5093 transitions. [2024-10-11 05:03:38,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4134 states and 5093 transitions. [2024-10-11 05:03:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:38,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:38,356 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] [2024-10-11 05:03:38,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:03:38,356 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:38,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash 129469307, now seen corresponding path program 1 times [2024-10-11 05:03:38,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:38,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942840307] [2024-10-11 05:03:38,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:38,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:38,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:38,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942840307] [2024-10-11 05:03:38,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942840307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:38,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312711841] [2024-10-11 05:03:38,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:38,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:38,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:38,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:38,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:38,444 INFO L87 Difference]: Start difference. First operand 4134 states and 5093 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:39,896 INFO L93 Difference]: Finished difference Result 4621 states and 5885 transitions. [2024-10-11 05:03:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:39,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:39,909 INFO L225 Difference]: With dead ends: 4621 [2024-10-11 05:03:39,909 INFO L226 Difference]: Without dead ends: 4440 [2024-10-11 05:03:39,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:39,911 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 936 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:39,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 797 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:03:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4440 states. [2024-10-11 05:03:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4440 to 4319. [2024-10-11 05:03:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4319 states, 3291 states have (on average 1.2716499544211486) internal successors, (4185), 3359 states have internal predecessors, (4185), 501 states have call successors, (501), 403 states have call predecessors, (501), 525 states have return successors, (703), 563 states have call predecessors, (703), 498 states have call successors, (703) [2024-10-11 05:03:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 5389 transitions. [2024-10-11 05:03:40,437 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 5389 transitions. Word has length 92 [2024-10-11 05:03:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:40,437 INFO L471 AbstractCegarLoop]: Abstraction has 4319 states and 5389 transitions. [2024-10-11 05:03:40,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 5389 transitions. [2024-10-11 05:03:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:40,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:40,440 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] [2024-10-11 05:03:40,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:03:40,440 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:40,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash 968502969, now seen corresponding path program 1 times [2024-10-11 05:03:40,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:40,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844519130] [2024-10-11 05:03:40,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:40,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:40,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844519130] [2024-10-11 05:03:40,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844519130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:40,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:40,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014706028] [2024-10-11 05:03:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:40,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:40,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:40,545 INFO L87 Difference]: Start difference. First operand 4319 states and 5389 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:42,606 INFO L93 Difference]: Finished difference Result 5058 states and 6589 transitions. [2024-10-11 05:03:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:03:42,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:42,622 INFO L225 Difference]: With dead ends: 5058 [2024-10-11 05:03:42,622 INFO L226 Difference]: Without dead ends: 4692 [2024-10-11 05:03:42,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:03:42,625 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 949 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 2081 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:42,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1387 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2081 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:03:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2024-10-11 05:03:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 4492. [2024-10-11 05:03:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 3443 states have (on average 1.2855068254429276) internal successors, (4426), 3512 states have internal predecessors, (4426), 515 states have call successors, (515), 409 states have call predecessors, (515), 532 states have return successors, (719), 578 states have call predecessors, (719), 512 states have call successors, (719) [2024-10-11 05:03:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 5660 transitions. [2024-10-11 05:03:43,266 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 5660 transitions. Word has length 92 [2024-10-11 05:03:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:43,267 INFO L471 AbstractCegarLoop]: Abstraction has 4492 states and 5660 transitions. [2024-10-11 05:03:43,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 5660 transitions. [2024-10-11 05:03:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:43,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:43,270 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] [2024-10-11 05:03:43,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:03:43,271 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:43,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1108833929, now seen corresponding path program 1 times [2024-10-11 05:03:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:43,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141570331] [2024-10-11 05:03:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141570331] [2024-10-11 05:03:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141570331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:43,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981231863] [2024-10-11 05:03:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:43,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:43,374 INFO L87 Difference]: Start difference. First operand 4492 states and 5660 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:44,677 INFO L93 Difference]: Finished difference Result 5233 states and 6870 transitions. [2024-10-11 05:03:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:44,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:44,692 INFO L225 Difference]: With dead ends: 5233 [2024-10-11 05:03:44,693 INFO L226 Difference]: Without dead ends: 4694 [2024-10-11 05:03:44,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:44,696 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 746 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:44,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 809 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:03:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2024-10-11 05:03:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 4492. [2024-10-11 05:03:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 3443 states have (on average 1.284635492303224) internal successors, (4423), 3512 states have internal predecessors, (4423), 515 states have call successors, (515), 409 states have call predecessors, (515), 532 states have return successors, (719), 578 states have call predecessors, (719), 512 states have call successors, (719) [2024-10-11 05:03:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 5657 transitions. [2024-10-11 05:03:45,254 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 5657 transitions. Word has length 92 [2024-10-11 05:03:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:45,255 INFO L471 AbstractCegarLoop]: Abstraction has 4492 states and 5657 transitions. [2024-10-11 05:03:45,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 5657 transitions. [2024-10-11 05:03:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:45,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:45,258 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] [2024-10-11 05:03:45,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:03:45,258 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:45,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash 625270521, now seen corresponding path program 1 times [2024-10-11 05:03:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:45,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487958318] [2024-10-11 05:03:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:45,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:45,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487958318] [2024-10-11 05:03:45,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487958318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:45,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:45,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:45,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766972243] [2024-10-11 05:03:45,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:45,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:45,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:45,362 INFO L87 Difference]: Start difference. First operand 4492 states and 5657 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:46,550 INFO L93 Difference]: Finished difference Result 5229 states and 6853 transitions. [2024-10-11 05:03:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:46,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:46,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:46,564 INFO L225 Difference]: With dead ends: 5229 [2024-10-11 05:03:46,564 INFO L226 Difference]: Without dead ends: 4690 [2024-10-11 05:03:46,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:46,566 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 867 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:46,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 670 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2024-10-11 05:03:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 4492. [2024-10-11 05:03:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 3443 states have (on average 1.2837641591635203) internal successors, (4420), 3512 states have internal predecessors, (4420), 515 states have call successors, (515), 409 states have call predecessors, (515), 532 states have return successors, (719), 578 states have call predecessors, (719), 512 states have call successors, (719) [2024-10-11 05:03:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 5654 transitions. [2024-10-11 05:03:47,097 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 5654 transitions. Word has length 92 [2024-10-11 05:03:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:47,097 INFO L471 AbstractCegarLoop]: Abstraction has 4492 states and 5654 transitions. [2024-10-11 05:03:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 5654 transitions. [2024-10-11 05:03:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:47,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:47,100 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] [2024-10-11 05:03:47,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:03:47,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:47,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:47,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1512493367, now seen corresponding path program 1 times [2024-10-11 05:03:47,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:47,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539124696] [2024-10-11 05:03:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:47,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:47,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:47,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539124696] [2024-10-11 05:03:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539124696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:47,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:47,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889600990] [2024-10-11 05:03:47,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:47,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:47,200 INFO L87 Difference]: Start difference. First operand 4492 states and 5654 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:48,551 INFO L93 Difference]: Finished difference Result 5225 states and 6836 transitions. [2024-10-11 05:03:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:48,566 INFO L225 Difference]: With dead ends: 5225 [2024-10-11 05:03:48,566 INFO L226 Difference]: Without dead ends: 4686 [2024-10-11 05:03:48,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:48,570 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 865 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:48,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 670 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4686 states. [2024-10-11 05:03:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4686 to 4492. [2024-10-11 05:03:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 3443 states have (on average 1.2828928260238164) internal successors, (4417), 3512 states have internal predecessors, (4417), 515 states have call successors, (515), 409 states have call predecessors, (515), 532 states have return successors, (719), 578 states have call predecessors, (719), 512 states have call successors, (719) [2024-10-11 05:03:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 5651 transitions. [2024-10-11 05:03:49,181 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 5651 transitions. Word has length 92 [2024-10-11 05:03:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:49,181 INFO L471 AbstractCegarLoop]: Abstraction has 4492 states and 5651 transitions. [2024-10-11 05:03:49,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 5651 transitions. [2024-10-11 05:03:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:49,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:49,184 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] [2024-10-11 05:03:49,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:03:49,184 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:49,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash -398549191, now seen corresponding path program 1 times [2024-10-11 05:03:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:49,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115100546] [2024-10-11 05:03:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:49,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115100546] [2024-10-11 05:03:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115100546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:49,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:49,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:49,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926417202] [2024-10-11 05:03:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:49,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:49,294 INFO L87 Difference]: Start difference. First operand 4492 states and 5651 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:51,206 INFO L93 Difference]: Finished difference Result 5820 states and 7760 transitions. [2024-10-11 05:03:51,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:03:51,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:51,225 INFO L225 Difference]: With dead ends: 5820 [2024-10-11 05:03:51,225 INFO L226 Difference]: Without dead ends: 5281 [2024-10-11 05:03:51,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:51,228 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 970 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:51,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1378 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:03:51,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2024-10-11 05:03:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 4846. [2024-10-11 05:03:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4846 states, 3757 states have (on average 1.3063614586105936) internal successors, (4908), 3828 states have internal predecessors, (4908), 541 states have call successors, (541), 421 states have call predecessors, (541), 546 states have return successors, (753), 606 states have call predecessors, (753), 538 states have call successors, (753) [2024-10-11 05:03:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4846 states to 4846 states and 6202 transitions. [2024-10-11 05:03:51,869 INFO L78 Accepts]: Start accepts. Automaton has 4846 states and 6202 transitions. Word has length 92 [2024-10-11 05:03:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:51,869 INFO L471 AbstractCegarLoop]: Abstraction has 4846 states and 6202 transitions. [2024-10-11 05:03:51,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4846 states and 6202 transitions. [2024-10-11 05:03:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:51,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:51,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:51,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:03:51,872 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:51,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash -321648393, now seen corresponding path program 1 times [2024-10-11 05:03:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:51,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471064596] [2024-10-11 05:03:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:51,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:51,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-11 05:03:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471064596] [2024-10-11 05:03:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471064596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:51,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138401625] [2024-10-11 05:03:51,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:51,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:51,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:51,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:51,997 INFO L87 Difference]: Start difference. First operand 4846 states and 6202 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:53,919 INFO L93 Difference]: Finished difference Result 7138 states and 9829 transitions. [2024-10-11 05:03:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:03:53,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:53,938 INFO L225 Difference]: With dead ends: 7138 [2024-10-11 05:03:53,938 INFO L226 Difference]: Without dead ends: 6245 [2024-10-11 05:03:53,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:53,942 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1075 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:53,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1374 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:03:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6245 states. [2024-10-11 05:03:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6245 to 5507. [2024-10-11 05:03:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5507 states, 4340 states have (on average 1.3382488479262673) internal successors, (5808), 4415 states have internal predecessors, (5808), 591 states have call successors, (591), 445 states have call predecessors, (591), 574 states have return successors, (825), 660 states have call predecessors, (825), 588 states have call successors, (825) [2024-10-11 05:03:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5507 states to 5507 states and 7224 transitions. [2024-10-11 05:03:54,608 INFO L78 Accepts]: Start accepts. Automaton has 5507 states and 7224 transitions. Word has length 92 [2024-10-11 05:03:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:54,609 INFO L471 AbstractCegarLoop]: Abstraction has 5507 states and 7224 transitions. [2024-10-11 05:03:54,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 5507 states and 7224 transitions. [2024-10-11 05:03:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:54,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:54,612 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] [2024-10-11 05:03:54,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:03:54,612 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:54,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1288999047, now seen corresponding path program 1 times [2024-10-11 05:03:54,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863191211] [2024-10-11 05:03:54,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:54,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:54,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:54,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:54,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:54,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-11 05:03:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863191211] [2024-10-11 05:03:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863191211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:54,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:54,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:54,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941298684] [2024-10-11 05:03:54,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:54,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:54,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:54,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:54,710 INFO L87 Difference]: Start difference. First operand 5507 states and 7224 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:56,035 INFO L93 Difference]: Finished difference Result 7515 states and 10413 transitions. [2024-10-11 05:03:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:56,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:56,057 INFO L225 Difference]: With dead ends: 7515 [2024-10-11 05:03:56,058 INFO L226 Difference]: Without dead ends: 5961 [2024-10-11 05:03:56,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:56,064 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 759 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:56,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 807 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2024-10-11 05:03:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 5507. [2024-10-11 05:03:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5507 states, 4340 states have (on average 1.3361751152073733) internal successors, (5799), 4415 states have internal predecessors, (5799), 591 states have call successors, (591), 445 states have call predecessors, (591), 574 states have return successors, (825), 660 states have call predecessors, (825), 588 states have call successors, (825) [2024-10-11 05:03:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5507 states to 5507 states and 7215 transitions. [2024-10-11 05:03:56,743 INFO L78 Accepts]: Start accepts. Automaton has 5507 states and 7215 transitions. Word has length 92 [2024-10-11 05:03:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:56,743 INFO L471 AbstractCegarLoop]: Abstraction has 5507 states and 7215 transitions. [2024-10-11 05:03:56,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 5507 states and 7215 transitions. [2024-10-11 05:03:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:56,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:56,747 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] [2024-10-11 05:03:56,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:03:56,747 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:56,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash 619458743, now seen corresponding path program 1 times [2024-10-11 05:03:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:56,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798462602] [2024-10-11 05:03:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:03:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798462602] [2024-10-11 05:03:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798462602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:56,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:56,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133236157] [2024-10-11 05:03:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:56,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:56,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:56,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:56,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:56,856 INFO L87 Difference]: Start difference. First operand 5507 states and 7215 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:59,064 INFO L93 Difference]: Finished difference Result 9381 states and 13289 transitions. [2024-10-11 05:03:59,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:03:59,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:03:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:59,086 INFO L225 Difference]: With dead ends: 9381 [2024-10-11 05:03:59,086 INFO L226 Difference]: Without dead ends: 7827 [2024-10-11 05:03:59,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:59,092 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 965 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:59,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1378 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7827 states. [2024-10-11 05:03:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7827 to 6886. [2024-10-11 05:03:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6886 states, 5567 states have (on average 1.3826118196515178) internal successors, (7697), 5650 states have internal predecessors, (7697), 687 states have call successors, (687), 493 states have call predecessors, (687), 630 states have return successors, (983), 764 states have call predecessors, (983), 684 states have call successors, (983) [2024-10-11 05:03:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 9367 transitions. [2024-10-11 05:03:59,882 INFO L78 Accepts]: Start accepts. Automaton has 6886 states and 9367 transitions. Word has length 92 [2024-10-11 05:03:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:59,882 INFO L471 AbstractCegarLoop]: Abstraction has 6886 states and 9367 transitions. [2024-10-11 05:03:59,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 6886 states and 9367 transitions. [2024-10-11 05:03:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:03:59,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:59,886 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] [2024-10-11 05:03:59,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:03:59,886 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:59,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1573398901, now seen corresponding path program 1 times [2024-10-11 05:03:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:59,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726375977] [2024-10-11 05:03:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:03:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:03:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:04:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:00,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:04:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:00,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726375977] [2024-10-11 05:04:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726375977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:00,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:00,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:00,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675920980] [2024-10-11 05:04:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:00,010 INFO L87 Difference]: Start difference. First operand 6886 states and 9367 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:01,332 INFO L93 Difference]: Finished difference Result 10555 states and 15164 transitions. [2024-10-11 05:04:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:04:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:01,350 INFO L225 Difference]: With dead ends: 10555 [2024-10-11 05:04:01,350 INFO L226 Difference]: Without dead ends: 7622 [2024-10-11 05:04:01,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:01,357 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 863 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:01,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 669 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:04:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7622 states. [2024-10-11 05:04:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7622 to 6886. [2024-10-11 05:04:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6886 states, 5567 states have (on average 1.3795581102927967) internal successors, (7680), 5650 states have internal predecessors, (7680), 687 states have call successors, (687), 493 states have call predecessors, (687), 630 states have return successors, (983), 764 states have call predecessors, (983), 684 states have call successors, (983) [2024-10-11 05:04:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 9350 transitions. [2024-10-11 05:04:02,157 INFO L78 Accepts]: Start accepts. Automaton has 6886 states and 9350 transitions. Word has length 92 [2024-10-11 05:04:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:02,157 INFO L471 AbstractCegarLoop]: Abstraction has 6886 states and 9350 transitions. [2024-10-11 05:04:02,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6886 states and 9350 transitions. [2024-10-11 05:04:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:04:02,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:02,161 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] [2024-10-11 05:04:02,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:04:02,161 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:02,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:02,161 INFO L85 PathProgramCache]: Analyzing trace with hash 357245175, now seen corresponding path program 1 times [2024-10-11 05:04:02,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:02,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584919422] [2024-10-11 05:04:02,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:02,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:04:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:04:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:04:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:04:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:02,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:02,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584919422] [2024-10-11 05:04:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584919422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:02,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579147933] [2024-10-11 05:04:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:02,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:02,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:02,249 INFO L87 Difference]: Start difference. First operand 6886 states and 9350 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:03,663 INFO L93 Difference]: Finished difference Result 10552 states and 15140 transitions. [2024-10-11 05:04:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:03,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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 92 [2024-10-11 05:04:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:03,683 INFO L225 Difference]: With dead ends: 10552 [2024-10-11 05:04:03,683 INFO L226 Difference]: Without dead ends: 7620 [2024-10-11 05:04:03,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:03,691 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 332 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:03,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 916 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:04:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2024-10-11 05:04:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 6920. [2024-10-11 05:04:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6920 states, 5601 states have (on average 1.3772540617746831) internal successors, (7714), 5684 states have internal predecessors, (7714), 687 states have call successors, (687), 493 states have call predecessors, (687), 630 states have return successors, (983), 764 states have call predecessors, (983), 684 states have call successors, (983) [2024-10-11 05:04:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6920 states to 6920 states and 9384 transitions. [2024-10-11 05:04:04,485 INFO L78 Accepts]: Start accepts. Automaton has 6920 states and 9384 transitions. Word has length 92 [2024-10-11 05:04:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:04,485 INFO L471 AbstractCegarLoop]: Abstraction has 6920 states and 9384 transitions. [2024-10-11 05:04:04,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6920 states and 9384 transitions. [2024-10-11 05:04:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:04:04,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:04,488 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] [2024-10-11 05:04:04,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:04:04,489 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:04,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 917944953, now seen corresponding path program 1 times [2024-10-11 05:04:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217508109] [2024-10-11 05:04:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:04,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:04:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:04:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:04:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:04:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217508109] [2024-10-11 05:04:04,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217508109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:04,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:04,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:04,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847418053] [2024-10-11 05:04:04,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:04,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:04,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:04,618 INFO L87 Difference]: Start difference. First operand 6920 states and 9384 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:07,346 INFO L93 Difference]: Finished difference Result 17602 states and 26419 transitions. [2024-10-11 05:04:07,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 05:04:07,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:04:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:07,379 INFO L225 Difference]: With dead ends: 17602 [2024-10-11 05:04:07,379 INFO L226 Difference]: Without dead ends: 14636 [2024-10-11 05:04:07,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:04:07,389 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 1973 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:07,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 1150 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:04:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14636 states. [2024-10-11 05:04:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14636 to 12630. [2024-10-11 05:04:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12630 states, 10642 states have (on average 1.4431497838752114) internal successors, (15358), 10784 states have internal predecessors, (15358), 1114 states have call successors, (1114), 703 states have call predecessors, (1114), 872 states have return successors, (1734), 1164 states have call predecessors, (1734), 1111 states have call successors, (1734) [2024-10-11 05:04:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12630 states to 12630 states and 18206 transitions. [2024-10-11 05:04:08,616 INFO L78 Accepts]: Start accepts. Automaton has 12630 states and 18206 transitions. Word has length 92 [2024-10-11 05:04:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:08,616 INFO L471 AbstractCegarLoop]: Abstraction has 12630 states and 18206 transitions. [2024-10-11 05:04:08,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 12630 states and 18206 transitions. [2024-10-11 05:04:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:04:08,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:08,627 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:08,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:04:08,627 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:08,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash 73622291, now seen corresponding path program 1 times [2024-10-11 05:04:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:08,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063258765] [2024-10-11 05:04:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:08,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:04:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:04:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:04:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:04:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 05:04:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:04:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 05:04:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 05:04:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:08,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063258765] [2024-10-11 05:04:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063258765] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:08,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648656692] [2024-10-11 05:04:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:08,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:08,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:08,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:08,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:04:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:04:08,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 05:04:08,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:04:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648656692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:08,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:04:08,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-11 05:04:08,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667563920] [2024-10-11 05:04:08,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:08,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:08,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:08,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:04:08,867 INFO L87 Difference]: Start difference. First operand 12630 states and 18206 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:04:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:09,745 INFO L93 Difference]: Finished difference Result 14477 states and 20459 transitions. [2024-10-11 05:04:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:04:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-10-11 05:04:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:09,772 INFO L225 Difference]: With dead ends: 14477 [2024-10-11 05:04:09,772 INFO L226 Difference]: Without dead ends: 10561 [2024-10-11 05:04:09,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:04:09,779 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 0 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:09,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1918 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:04:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10561 states. [2024-10-11 05:04:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10561 to 10561. [2024-10-11 05:04:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10561 states, 9150 states have (on average 1.4753005464480875) internal successors, (13499), 9241 states have internal predecessors, (13499), 838 states have call successors, (838), 469 states have call predecessors, (838), 571 states have return successors, (1341), 866 states have call predecessors, (1341), 835 states have call successors, (1341) [2024-10-11 05:04:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10561 states to 10561 states and 15678 transitions. [2024-10-11 05:04:10,614 INFO L78 Accepts]: Start accepts. Automaton has 10561 states and 15678 transitions. Word has length 131 [2024-10-11 05:04:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:10,614 INFO L471 AbstractCegarLoop]: Abstraction has 10561 states and 15678 transitions. [2024-10-11 05:04:10,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:04:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10561 states and 15678 transitions. [2024-10-11 05:04:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 05:04:10,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:10,623 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:10,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 05:04:10,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 05:04:10,823 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:10,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1340409721, now seen corresponding path program 1 times [2024-10-11 05:04:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:10,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675058193] [2024-10-11 05:04:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:04:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 05:04:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:04:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 05:04:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:04:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:04:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-11 05:04:10,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:10,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675058193] [2024-10-11 05:04:10,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675058193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:10,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:10,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124503436] [2024-10-11 05:04:10,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:10,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:10,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:10,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:10,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:10,886 INFO L87 Difference]: Start difference. First operand 10561 states and 15678 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 05:04:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:12,023 INFO L93 Difference]: Finished difference Result 10626 states and 15746 transitions. [2024-10-11 05:04:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:12,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2024-10-11 05:04:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:12,051 INFO L225 Difference]: With dead ends: 10626 [2024-10-11 05:04:12,051 INFO L226 Difference]: Without dead ends: 10224 [2024-10-11 05:04:12,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:04:12,057 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 439 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:12,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 861 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:04:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10224 states. [2024-10-11 05:04:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10224 to 10162. [2024-10-11 05:04:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10162 states, 8847 states have (on average 1.484797106363739) internal successors, (13136), 8935 states have internal predecessors, (13136), 792 states have call successors, (792), 429 states have call predecessors, (792), 521 states have return successors, (1277), 813 states have call predecessors, (1277), 789 states have call successors, (1277) [2024-10-11 05:04:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 15205 transitions. [2024-10-11 05:04:12,893 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 15205 transitions. Word has length 133 [2024-10-11 05:04:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:12,893 INFO L471 AbstractCegarLoop]: Abstraction has 10162 states and 15205 transitions. [2024-10-11 05:04:12,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 05:04:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 15205 transitions. [2024-10-11 05:04:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 05:04:12,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:12,903 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:12,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 05:04:12,903 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:12,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash -950095919, now seen corresponding path program 1 times [2024-10-11 05:04:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891578811] [2024-10-11 05:04:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:04:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:04:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:04:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:04:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:04:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:04:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 05:04:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 05:04:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891578811] [2024-10-11 05:04:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891578811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:12,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:12,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445728741] [2024-10-11 05:04:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:12,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:12,989 INFO L87 Difference]: Start difference. First operand 10162 states and 15205 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:04:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:14,133 INFO L93 Difference]: Finished difference Result 11509 states and 16874 transitions. [2024-10-11 05:04:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:04:14,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2024-10-11 05:04:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:14,160 INFO L225 Difference]: With dead ends: 11509 [2024-10-11 05:04:14,161 INFO L226 Difference]: Without dead ends: 10269 [2024-10-11 05:04:14,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:14,168 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 371 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:14,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1192 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:04:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10269 states. [2024-10-11 05:04:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10269 to 10087. [2024-10-11 05:04:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10087 states, 8794 states have (on average 1.4858994769160792) internal successors, (13067), 8883 states have internal predecessors, (13067), 783 states have call successors, (783), 424 states have call predecessors, (783), 508 states have return successors, (1261), 795 states have call predecessors, (1261), 780 states have call successors, (1261) [2024-10-11 05:04:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10087 states to 10087 states and 15111 transitions. [2024-10-11 05:04:15,306 INFO L78 Accepts]: Start accepts. Automaton has 10087 states and 15111 transitions. Word has length 145 [2024-10-11 05:04:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:15,306 INFO L471 AbstractCegarLoop]: Abstraction has 10087 states and 15111 transitions. [2024-10-11 05:04:15,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:04:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 10087 states and 15111 transitions. [2024-10-11 05:04:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 05:04:15,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:15,317 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:15,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 05:04:15,318 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:15,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:15,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1799056812, now seen corresponding path program 1 times [2024-10-11 05:04:15,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:15,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155867225] [2024-10-11 05:04:15,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:04:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:04:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:04:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:04:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 05:04:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:04:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:04:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 05:04:15,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155867225] [2024-10-11 05:04:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155867225] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:15,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646907368] [2024-10-11 05:04:15,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:15,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:15,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:15,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:15,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:04:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 05:04:15,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 05:04:15,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:04:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-11 05:04:15,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646907368] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:04:15,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:04:15,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-11 05:04:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594419859] [2024-10-11 05:04:15,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:04:15,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 05:04:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 05:04:15,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 05:04:15,839 INFO L87 Difference]: Start difference. First operand 10087 states and 15111 transitions. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-11 05:04:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:17,465 INFO L93 Difference]: Finished difference Result 11894 states and 17399 transitions. [2024-10-11 05:04:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 05:04:17,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 147 [2024-10-11 05:04:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:17,490 INFO L225 Difference]: With dead ends: 11894 [2024-10-11 05:04:17,491 INFO L226 Difference]: Without dead ends: 10592 [2024-10-11 05:04:17,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-11 05:04:17,495 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1275 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:17,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 892 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:04:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10592 states. [2024-10-11 05:04:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10592 to 10448. [2024-10-11 05:04:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10448 states, 9043 states have (on average 1.4752847506358509) internal successors, (13341), 9140 states have internal predecessors, (13341), 837 states have call successors, (837), 474 states have call predecessors, (837), 566 states have return successors, (1375), 849 states have call predecessors, (1375), 834 states have call successors, (1375) [2024-10-11 05:04:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10448 states to 10448 states and 15553 transitions. [2024-10-11 05:04:18,335 INFO L78 Accepts]: Start accepts. Automaton has 10448 states and 15553 transitions. Word has length 147 [2024-10-11 05:04:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:18,336 INFO L471 AbstractCegarLoop]: Abstraction has 10448 states and 15553 transitions. [2024-10-11 05:04:18,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-11 05:04:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 10448 states and 15553 transitions. [2024-10-11 05:04:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 05:04:18,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:18,345 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:18,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 05:04:18,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:18,546 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:18,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash -464187984, now seen corresponding path program 1 times [2024-10-11 05:04:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:18,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238375856] [2024-10-11 05:04:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:04:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:04:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:04:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:04:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:04:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:04:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:04:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:04:18,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238375856] [2024-10-11 05:04:18,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238375856] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247595428] [2024-10-11 05:04:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:18,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:18,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:18,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:04:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:04:18,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 05:04:18,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:04:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247595428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:18,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:04:18,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:04:18,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285008517] [2024-10-11 05:04:18,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:18,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:04:18,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:18,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:04:18,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:18,798 INFO L87 Difference]: Start difference. First operand 10448 states and 15553 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:20,180 INFO L93 Difference]: Finished difference Result 27639 states and 42545 transitions. [2024-10-11 05:04:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:04:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2024-10-11 05:04:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:20,232 INFO L225 Difference]: With dead ends: 27639 [2024-10-11 05:04:20,232 INFO L226 Difference]: Without dead ends: 18963 [2024-10-11 05:04:20,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:20,256 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 363 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:20,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 633 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:04:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18963 states. [2024-10-11 05:04:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18963 to 18907. [2024-10-11 05:04:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18907 states, 16528 states have (on average 1.4935866408518876) internal successors, (24686), 16700 states have internal predecessors, (24686), 1451 states have call successors, (1451), 786 states have call predecessors, (1451), 926 states have return successors, (2380), 1436 states have call predecessors, (2380), 1448 states have call successors, (2380) [2024-10-11 05:04:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18907 states to 18907 states and 28517 transitions. [2024-10-11 05:04:21,741 INFO L78 Accepts]: Start accepts. Automaton has 18907 states and 28517 transitions. Word has length 148 [2024-10-11 05:04:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:21,742 INFO L471 AbstractCegarLoop]: Abstraction has 18907 states and 28517 transitions. [2024-10-11 05:04:21,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 18907 states and 28517 transitions. [2024-10-11 05:04:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 05:04:21,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:21,759 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:21,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 05:04:21,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 05:04:21,959 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:21,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1366017650, now seen corresponding path program 1 times [2024-10-11 05:04:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:21,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476044714] [2024-10-11 05:04:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:21,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:21,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:04:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:04:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:04:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:04:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:04:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:04:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:04:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:04:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:22,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476044714] [2024-10-11 05:04:22,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476044714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:22,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406343321] [2024-10-11 05:04:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:22,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:22,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:22,054 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:22,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 05:04:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:22,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:04:22,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 05:04:22,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:04:22,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406343321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:22,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:04:22,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:04:22,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142361643] [2024-10-11 05:04:22,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:22,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:04:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:22,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:04:22,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:22,206 INFO L87 Difference]: Start difference. First operand 18907 states and 28517 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:24,718 INFO L93 Difference]: Finished difference Result 52760 states and 81372 transitions. [2024-10-11 05:04:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:04:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2024-10-11 05:04:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:24,806 INFO L225 Difference]: With dead ends: 52760 [2024-10-11 05:04:24,806 INFO L226 Difference]: Without dead ends: 35625 [2024-10-11 05:04:24,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:24,844 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 358 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:24,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 631 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:04:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35625 states. [2024-10-11 05:04:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35625 to 35517. [2024-10-11 05:04:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35517 states, 31266 states have (on average 1.502846542570204) internal successors, (46988), 31588 states have internal predecessors, (46988), 2603 states have call successors, (2603), 1410 states have call predecessors, (2603), 1646 states have return successors, (4275), 2534 states have call predecessors, (4275), 2600 states have call successors, (4275) [2024-10-11 05:04:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35517 states to 35517 states and 53866 transitions. [2024-10-11 05:04:27,999 INFO L78 Accepts]: Start accepts. Automaton has 35517 states and 53866 transitions. Word has length 148 [2024-10-11 05:04:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:27,999 INFO L471 AbstractCegarLoop]: Abstraction has 35517 states and 53866 transitions. [2024-10-11 05:04:27,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:04:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 35517 states and 53866 transitions. [2024-10-11 05:04:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 05:04:28,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:28,031 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:28,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 05:04:28,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-11 05:04:28,232 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:28,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2026970224, now seen corresponding path program 1 times [2024-10-11 05:04:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47896030] [2024-10-11 05:04:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:04:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:04:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:04:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:04:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:04:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:04:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:04:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:04:28,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47896030] [2024-10-11 05:04:28,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47896030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666753606] [2024-10-11 05:04:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:28,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:28,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:28,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:28,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 05:04:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:04:28,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 05:04:28,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:04:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666753606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:28,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:04:28,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:04:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139469676] [2024-10-11 05:04:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:28,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:04:28,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:28,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:04:28,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:28,445 INFO L87 Difference]: Start difference. First operand 35517 states and 53866 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 05:04:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:33,795 INFO L93 Difference]: Finished difference Result 101766 states and 155996 transitions. [2024-10-11 05:04:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:04:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 148 [2024-10-11 05:04:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:33,929 INFO L225 Difference]: With dead ends: 101766 [2024-10-11 05:04:33,929 INFO L226 Difference]: Without dead ends: 41369 [2024-10-11 05:04:34,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:34,033 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 253 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:34,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1003 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:04:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41369 states. [2024-10-11 05:04:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41369 to 41369. [2024-10-11 05:04:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41369 states, 36458 states have (on average 1.5034011739535904) internal successors, (54811), 36812 states have internal predecessors, (54811), 3015 states have call successors, (3015), 1626 states have call predecessors, (3015), 1894 states have return successors, (4995), 2946 states have call predecessors, (4995), 3012 states have call successors, (4995) [2024-10-11 05:04:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41369 states to 41369 states and 62821 transitions. [2024-10-11 05:04:37,742 INFO L78 Accepts]: Start accepts. Automaton has 41369 states and 62821 transitions. Word has length 148 [2024-10-11 05:04:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:37,743 INFO L471 AbstractCegarLoop]: Abstraction has 41369 states and 62821 transitions. [2024-10-11 05:04:37,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 05:04:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 41369 states and 62821 transitions. [2024-10-11 05:04:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 05:04:37,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:37,780 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:37,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 05:04:37,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-11 05:04:37,981 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:37,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash -615933476, now seen corresponding path program 1 times [2024-10-11 05:04:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:37,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922371073] [2024-10-11 05:04:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:04:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 05:04:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:04:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:04:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:04:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:04:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 05:04:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 05:04:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 05:04:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 05:04:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:04:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-11 05:04:38,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:38,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922371073] [2024-10-11 05:04:38,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922371073] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:38,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291345817] [2024-10-11 05:04:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:38,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:38,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:38,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:38,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 05:04:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:38,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 05:04:38,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-11 05:04:38,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:04:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291345817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:38,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:04:38,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-11 05:04:38,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037618429] [2024-10-11 05:04:38,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:38,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:04:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:04:38,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:04:38,208 INFO L87 Difference]: Start difference. First operand 41369 states and 62821 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)