./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 af1a65b4dba99a03062f9c0ef0e7df0ff9812521932f446bc475a13832d55c02 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 20:39:26,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 20:39:26,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 20:39:26,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 20:39:26,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 20:39:26,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 20:39:26,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 20:39:26,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 20:39:26,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 20:39:26,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 20:39:26,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 20:39:26,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 20:39:26,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 20:39:26,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 20:39:26,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 20:39:26,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 20:39:26,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 20:39:26,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 20:39:26,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 20:39:26,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 20:39:26,407 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 20:39:26,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 20:39:26,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 20:39:26,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 20:39:26,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 20:39:26,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 20:39:26,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 20:39:26,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 20:39:26,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 20:39:26,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 20:39:26,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 20:39:26,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 20:39:26,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 20:39:26,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 20:39:26,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 20:39:26,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 20:39:26,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 20:39:26,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 20:39:26,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 20:39:26,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 20:39:26,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 20:39:26,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 20:39:26,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 20:39:26,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 20:39:26,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 20:39:26,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 20:39:26,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 20:39:26,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 20:39:26,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 20:39:26,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 20:39:26,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 20:39:26,452 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 20:39:26,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 20:39:26,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 20:39:26,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 20:39:26,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 20:39:26,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 20:39:26,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 20:39:26,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 20:39:26,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 20:39:26,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 20:39:26,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 20:39:26,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 20:39:26,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 20:39:26,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 20:39:26,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 20:39:26,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 20:39:26,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:39:26,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 20:39:26,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 20:39:26,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 20:39:26,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 20:39:26,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 20:39:26,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 20:39:26,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 20:39:26,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 20:39:26,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> af1a65b4dba99a03062f9c0ef0e7df0ff9812521932f446bc475a13832d55c02 [2022-07-19 20:39:26,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 20:39:26,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 20:39:26,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 20:39:26,700 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 20:39:26,714 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 20:39:26,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c [2022-07-19 20:39:26,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c239a4a4a/7291675a085a45739d299a9996ac8084/FLAGd3009c83f [2022-07-19 20:39:27,150 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 20:39:27,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.15.cil.c [2022-07-19 20:39:27,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c239a4a4a/7291675a085a45739d299a9996ac8084/FLAGd3009c83f [2022-07-19 20:39:27,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c239a4a4a/7291675a085a45739d299a9996ac8084 [2022-07-19 20:39:27,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 20:39:27,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 20:39:27,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 20:39:27,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 20:39:27,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 20:39:27,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e5ecb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27, skipping insertion in model container [2022-07-19 20:39:27,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 20:39:27,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 20:39:27,347 WARN L230 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_3.cil+token_ring.15.cil.c[911,924] [2022-07-19 20:39:27,381 WARN L230 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_3.cil+token_ring.15.cil.c[8416,8429] [2022-07-19 20:39:27,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:39:27,479 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 20:39:27,486 WARN L230 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_3.cil+token_ring.15.cil.c[911,924] [2022-07-19 20:39:27,498 WARN L230 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_3.cil+token_ring.15.cil.c[8416,8429] [2022-07-19 20:39:27,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:39:27,571 INFO L208 MainTranslator]: Completed translation [2022-07-19 20:39:27,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27 WrapperNode [2022-07-19 20:39:27,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 20:39:27,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 20:39:27,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 20:39:27,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 20:39:27,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,624 INFO L137 Inliner]: procedures = 81, calls = 101, calls flagged for inlining = 49, calls inlined = 49, statements flattened = 1139 [2022-07-19 20:39:27,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 20:39:27,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 20:39:27,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 20:39:27,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 20:39:27,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 20:39:27,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 20:39:27,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 20:39:27,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 20:39:27,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (1/1) ... [2022-07-19 20:39:27,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:39:27,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:39:27,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 20:39:27,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 20:39:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 20:39:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-19 20:39:27,747 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-19 20:39:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-19 20:39:27,751 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-19 20:39:27,751 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-19 20:39:27,752 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-19 20:39:27,752 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-19 20:39:27,752 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-19 20:39:27,752 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-19 20:39:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-19 20:39:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-19 20:39:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-19 20:39:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-19 20:39:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-19 20:39:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-19 20:39:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-19 20:39:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-19 20:39:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-19 20:39:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-19 20:39:27,754 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-19 20:39:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-19 20:39:27,754 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-19 20:39:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 20:39:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-19 20:39:27,754 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-19 20:39:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-19 20:39:27,754 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-19 20:39:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 20:39:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 20:39:27,755 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-19 20:39:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-19 20:39:27,755 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-19 20:39:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-19 20:39:27,844 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 20:39:27,845 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 20:39:28,508 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-07-19 20:39:28,508 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-07-19 20:39:28,571 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 20:39:28,586 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 20:39:28,586 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-07-19 20:39:28,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:39:28 BoogieIcfgContainer [2022-07-19 20:39:28,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 20:39:28,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 20:39:28,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 20:39:28,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 20:39:28,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 08:39:27" (1/3) ... [2022-07-19 20:39:28,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d193ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:39:28, skipping insertion in model container [2022-07-19 20:39:28,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:39:27" (2/3) ... [2022-07-19 20:39:28,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d193ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:39:28, skipping insertion in model container [2022-07-19 20:39:28,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:39:28" (3/3) ... [2022-07-19 20:39:28,596 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.15.cil.c [2022-07-19 20:39:28,606 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 20:39:28,606 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 20:39:28,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 20:39:28,677 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@328701eb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@497a10d6 [2022-07-19 20:39:28,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-19 20:39:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 530 states, 467 states have (on average 1.6445396145610278) internal successors, (768), 475 states have internal predecessors, (768), 45 states have call successors, (45), 15 states have call predecessors, (45), 15 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2022-07-19 20:39:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 20:39:28,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:28,693 INFO L195 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] [2022-07-19 20:39:28,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:28,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:28,698 INFO L85 PathProgramCache]: Analyzing trace with hash -103676450, now seen corresponding path program 1 times [2022-07-19 20:39:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:28,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053965298] [2022-07-19 20:39:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:28,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:39:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:28,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:39:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:39:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:29,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053965298] [2022-07-19 20:39:29,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053965298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:29,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:29,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:39:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016026981] [2022-07-19 20:39:29,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:29,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:39:29,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:29,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:39:29,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:39:29,033 INFO L87 Difference]: Start difference. First operand has 530 states, 467 states have (on average 1.6445396145610278) internal successors, (768), 475 states have internal predecessors, (768), 45 states have call successors, (45), 15 states have call predecessors, (45), 15 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-07-19 20:39:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:30,067 INFO L93 Difference]: Finished difference Result 1181 states and 1901 transitions. [2022-07-19 20:39:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:39:30,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-07-19 20:39:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:30,081 INFO L225 Difference]: With dead ends: 1181 [2022-07-19 20:39:30,082 INFO L226 Difference]: Without dead ends: 670 [2022-07-19 20:39:30,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-19 20:39:30,089 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 1720 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:30,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 2345 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 20:39:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-07-19 20:39:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 631. [2022-07-19 20:39:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 549 states have (on average 1.53551912568306) internal successors, (843), 556 states have internal predecessors, (843), 58 states have call successors, (58), 22 states have call predecessors, (58), 22 states have return successors, (59), 55 states have call predecessors, (59), 54 states have call successors, (59) [2022-07-19 20:39:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 960 transitions. [2022-07-19 20:39:30,198 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 960 transitions. Word has length 65 [2022-07-19 20:39:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:30,199 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 960 transitions. [2022-07-19 20:39:30,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-07-19 20:39:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 960 transitions. [2022-07-19 20:39:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 20:39:30,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:30,204 INFO L195 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] [2022-07-19 20:39:30,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 20:39:30,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:30,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1575212190, now seen corresponding path program 1 times [2022-07-19 20:39:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:30,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969236223] [2022-07-19 20:39:30,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:30,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:30,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:30,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:30,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:39:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:30,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 20:39:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 20:39:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:30,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969236223] [2022-07-19 20:39:30,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969236223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:30,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:30,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 20:39:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894569752] [2022-07-19 20:39:30,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:30,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 20:39:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 20:39:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 20:39:30,351 INFO L87 Difference]: Start difference. First operand 631 states and 960 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 20:39:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:32,053 INFO L93 Difference]: Finished difference Result 1664 states and 2420 transitions. [2022-07-19 20:39:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-19 20:39:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-07-19 20:39:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:32,060 INFO L225 Difference]: With dead ends: 1664 [2022-07-19 20:39:32,060 INFO L226 Difference]: Without dead ends: 1443 [2022-07-19 20:39:32,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 20:39:32,062 INFO L413 NwaCegarLoop]: 938 mSDtfsCounter, 4057 mSDsluCounter, 2489 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4077 SdHoareTripleChecker+Valid, 3427 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:32,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4077 Valid, 3427 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 20:39:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-07-19 20:39:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1304. [2022-07-19 20:39:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1092 states have (on average 1.4487179487179487) internal successors, (1582), 1107 states have internal predecessors, (1582), 129 states have call successors, (129), 75 states have call predecessors, (129), 81 states have return successors, (139), 123 states have call predecessors, (139), 125 states have call successors, (139) [2022-07-19 20:39:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1850 transitions. [2022-07-19 20:39:32,137 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1850 transitions. Word has length 65 [2022-07-19 20:39:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:32,137 INFO L495 AbstractCegarLoop]: Abstraction has 1304 states and 1850 transitions. [2022-07-19 20:39:32,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 20:39:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1850 transitions. [2022-07-19 20:39:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 20:39:32,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:32,140 INFO L195 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] [2022-07-19 20:39:32,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 20:39:32,140 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash -74351947, now seen corresponding path program 1 times [2022-07-19 20:39:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:32,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046729844] [2022-07-19 20:39:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:32,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:32,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 20:39:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:32,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 20:39:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:32,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:32,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046729844] [2022-07-19 20:39:32,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046729844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:32,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:32,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 20:39:32,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944684204] [2022-07-19 20:39:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:32,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 20:39:32,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 20:39:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:39:32,245 INFO L87 Difference]: Start difference. First operand 1304 states and 1850 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-07-19 20:39:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:33,200 INFO L93 Difference]: Finished difference Result 2330 states and 3244 transitions. [2022-07-19 20:39:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 20:39:33,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-07-19 20:39:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:33,206 INFO L225 Difference]: With dead ends: 2330 [2022-07-19 20:39:33,206 INFO L226 Difference]: Without dead ends: 1442 [2022-07-19 20:39:33,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:39:33,209 INFO L413 NwaCegarLoop]: 790 mSDtfsCounter, 708 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:33,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 3514 Invalid, 1939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 20:39:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2022-07-19 20:39:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1334. [2022-07-19 20:39:33,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1116 states have (on average 1.4363799283154122) internal successors, (1603), 1131 states have internal predecessors, (1603), 129 states have call successors, (129), 75 states have call predecessors, (129), 87 states have return successors, (145), 129 states have call predecessors, (145), 125 states have call successors, (145) [2022-07-19 20:39:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1877 transitions. [2022-07-19 20:39:33,293 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1877 transitions. Word has length 66 [2022-07-19 20:39:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:33,293 INFO L495 AbstractCegarLoop]: Abstraction has 1334 states and 1877 transitions. [2022-07-19 20:39:33,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-07-19 20:39:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1877 transitions. [2022-07-19 20:39:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 20:39:33,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:33,295 INFO L195 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] [2022-07-19 20:39:33,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 20:39:33,295 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1103711245, now seen corresponding path program 1 times [2022-07-19 20:39:33,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:33,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190267670] [2022-07-19 20:39:33,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:33,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:33,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:33,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 20:39:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 20:39:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:33,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190267670] [2022-07-19 20:39:33,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190267670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:33,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:33,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 20:39:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581821091] [2022-07-19 20:39:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:33,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 20:39:33,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:33,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 20:39:33,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 20:39:33,396 INFO L87 Difference]: Start difference. First operand 1334 states and 1877 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 20:39:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:35,035 INFO L93 Difference]: Finished difference Result 3672 states and 5064 transitions. [2022-07-19 20:39:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-19 20:39:35,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-07-19 20:39:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:35,042 INFO L225 Difference]: With dead ends: 3672 [2022-07-19 20:39:35,042 INFO L226 Difference]: Without dead ends: 1577 [2022-07-19 20:39:35,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 20:39:35,047 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 4112 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4132 SdHoareTripleChecker+Valid, 3450 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:35,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4132 Valid, 3450 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 20:39:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-07-19 20:39:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1422. [2022-07-19 20:39:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1169 states have (on average 1.4029084687767321) internal successors, (1640), 1184 states have internal predecessors, (1640), 149 states have call successors, (149), 89 states have call predecessors, (149), 102 states have return successors, (166), 150 states have call predecessors, (166), 145 states have call successors, (166) [2022-07-19 20:39:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1955 transitions. [2022-07-19 20:39:35,092 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1955 transitions. Word has length 66 [2022-07-19 20:39:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:35,093 INFO L495 AbstractCegarLoop]: Abstraction has 1422 states and 1955 transitions. [2022-07-19 20:39:35,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 20:39:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1955 transitions. [2022-07-19 20:39:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 20:39:35,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:35,094 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 20:39:35,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 20:39:35,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:35,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1875323271, now seen corresponding path program 1 times [2022-07-19 20:39:35,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:35,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648773919] [2022-07-19 20:39:35,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:35,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:35,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:35,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:35,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 20:39:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:39:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 20:39:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 20:39:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:35,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648773919] [2022-07-19 20:39:35,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648773919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:35,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:35,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 20:39:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596170398] [2022-07-19 20:39:35,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:35,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 20:39:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 20:39:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:39:35,188 INFO L87 Difference]: Start difference. First operand 1422 states and 1955 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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) [2022-07-19 20:39:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:36,184 INFO L93 Difference]: Finished difference Result 2599 states and 3506 transitions. [2022-07-19 20:39:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 20:39:36,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2022-07-19 20:39:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:36,190 INFO L225 Difference]: With dead ends: 2599 [2022-07-19 20:39:36,190 INFO L226 Difference]: Without dead ends: 1593 [2022-07-19 20:39:36,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-19 20:39:36,194 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 700 mSDsluCounter, 2683 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:36,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 3463 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 20:39:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-07-19 20:39:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1462. [2022-07-19 20:39:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1201 states have (on average 1.3896752706078268) internal successors, (1669), 1216 states have internal predecessors, (1669), 149 states have call successors, (149), 89 states have call predecessors, (149), 110 states have return successors, (174), 158 states have call predecessors, (174), 145 states have call successors, (174) [2022-07-19 20:39:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1992 transitions. [2022-07-19 20:39:36,238 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1992 transitions. Word has length 91 [2022-07-19 20:39:36,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:36,238 INFO L495 AbstractCegarLoop]: Abstraction has 1462 states and 1992 transitions. [2022-07-19 20:39:36,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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) [2022-07-19 20:39:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1992 transitions. [2022-07-19 20:39:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 20:39:36,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:36,243 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 20:39:36,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 20:39:36,245 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1975743351, now seen corresponding path program 1 times [2022-07-19 20:39:36,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:36,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233603979] [2022-07-19 20:39:36,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:36,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:36,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:36,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 20:39:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:36,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:39:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:36,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 20:39:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 20:39:36,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:36,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233603979] [2022-07-19 20:39:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233603979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:36,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:36,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:39:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985136864] [2022-07-19 20:39:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:36,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:39:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:39:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:39:36,339 INFO L87 Difference]: Start difference. First operand 1462 states and 1992 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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) [2022-07-19 20:39:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:37,296 INFO L93 Difference]: Finished difference Result 3500 states and 4597 transitions. [2022-07-19 20:39:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 20:39:37,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-07-19 20:39:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:37,304 INFO L225 Difference]: With dead ends: 3500 [2022-07-19 20:39:37,305 INFO L226 Difference]: Without dead ends: 2455 [2022-07-19 20:39:37,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-19 20:39:37,310 INFO L413 NwaCegarLoop]: 810 mSDtfsCounter, 1941 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1975 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:37,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1975 Valid, 2387 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 20:39:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2022-07-19 20:39:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2139. [2022-07-19 20:39:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 1730 states have (on average 1.3485549132947976) internal successors, (2333), 1758 states have internal predecessors, (2333), 225 states have call successors, (225), 142 states have call predecessors, (225), 182 states have return successors, (287), 241 states have call predecessors, (287), 221 states have call successors, (287) [2022-07-19 20:39:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2845 transitions. [2022-07-19 20:39:37,378 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2845 transitions. Word has length 91 [2022-07-19 20:39:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:37,378 INFO L495 AbstractCegarLoop]: Abstraction has 2139 states and 2845 transitions. [2022-07-19 20:39:37,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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) [2022-07-19 20:39:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2845 transitions. [2022-07-19 20:39:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 20:39:37,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:37,380 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 20:39:37,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 20:39:37,380 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -36581305, now seen corresponding path program 1 times [2022-07-19 20:39:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:37,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836716050] [2022-07-19 20:39:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:37,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:37,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:37,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:37,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:37,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 20:39:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:39:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 20:39:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 20:39:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:37,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836716050] [2022-07-19 20:39:37,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836716050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:37,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:37,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:39:37,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053777062] [2022-07-19 20:39:37,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:37,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:39:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:37,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:39:37,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:39:37,456 INFO L87 Difference]: Start difference. First operand 2139 states and 2845 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 20:39:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:37,958 INFO L93 Difference]: Finished difference Result 5798 states and 7627 transitions. [2022-07-19 20:39:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 20:39:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-07-19 20:39:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:37,974 INFO L225 Difference]: With dead ends: 5798 [2022-07-19 20:39:37,974 INFO L226 Difference]: Without dead ends: 4078 [2022-07-19 20:39:37,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-19 20:39:37,979 INFO L413 NwaCegarLoop]: 784 mSDtfsCounter, 1486 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:37,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 2299 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 20:39:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2022-07-19 20:39:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 3858. [2022-07-19 20:39:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 3068 states have (on average 1.302477183833116) internal successors, (3996), 3132 states have internal predecessors, (3996), 418 states have call successors, (418), 276 states have call predecessors, (418), 370 states have return successors, (627), 454 states have call predecessors, (627), 414 states have call successors, (627) [2022-07-19 20:39:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 5041 transitions. [2022-07-19 20:39:38,127 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 5041 transitions. Word has length 91 [2022-07-19 20:39:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:38,127 INFO L495 AbstractCegarLoop]: Abstraction has 3858 states and 5041 transitions. [2022-07-19 20:39:38,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 20:39:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 5041 transitions. [2022-07-19 20:39:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 20:39:38,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:38,129 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 20:39:38,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 20:39:38,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1094419383, now seen corresponding path program 1 times [2022-07-19 20:39:38,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:38,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056461219] [2022-07-19 20:39:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:38,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 20:39:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:39:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 20:39:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 20:39:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056461219] [2022-07-19 20:39:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056461219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:38,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:38,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:39:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083293200] [2022-07-19 20:39:38,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:38,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:39:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:39:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:39:38,185 INFO L87 Difference]: Start difference. First operand 3858 states and 5041 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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) [2022-07-19 20:39:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:38,665 INFO L93 Difference]: Finished difference Result 5696 states and 7344 transitions. [2022-07-19 20:39:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 20:39:38,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 91 [2022-07-19 20:39:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:38,675 INFO L225 Difference]: With dead ends: 5696 [2022-07-19 20:39:38,675 INFO L226 Difference]: Without dead ends: 2257 [2022-07-19 20:39:38,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:38,682 INFO L413 NwaCegarLoop]: 774 mSDtfsCounter, 1160 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:38,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1807 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 20:39:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2022-07-19 20:39:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2139. [2022-07-19 20:39:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 1730 states have (on average 1.323699421965318) internal successors, (2290), 1758 states have internal predecessors, (2290), 225 states have call successors, (225), 142 states have call predecessors, (225), 182 states have return successors, (287), 241 states have call predecessors, (287), 221 states have call successors, (287) [2022-07-19 20:39:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2802 transitions. [2022-07-19 20:39:38,776 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2802 transitions. Word has length 91 [2022-07-19 20:39:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:38,776 INFO L495 AbstractCegarLoop]: Abstraction has 2139 states and 2802 transitions. [2022-07-19 20:39:38,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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) [2022-07-19 20:39:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2802 transitions. [2022-07-19 20:39:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 20:39:38,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:38,779 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 20:39:38,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 20:39:38,780 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1268013203, now seen corresponding path program 1 times [2022-07-19 20:39:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:38,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758056945] [2022-07-19 20:39:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:38,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 20:39:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:39:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 20:39:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 20:39:38,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:38,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758056945] [2022-07-19 20:39:38,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758056945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:38,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:38,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 20:39:38,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125737093] [2022-07-19 20:39:38,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:38,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 20:39:38,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:38,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 20:39:38,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:39:38,874 INFO L87 Difference]: Start difference. First operand 2139 states and 2802 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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) [2022-07-19 20:39:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:40,087 INFO L93 Difference]: Finished difference Result 4965 states and 6404 transitions. [2022-07-19 20:39:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 20:39:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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 92 [2022-07-19 20:39:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:40,109 INFO L225 Difference]: With dead ends: 4965 [2022-07-19 20:39:40,109 INFO L226 Difference]: Without dead ends: 2938 [2022-07-19 20:39:40,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-07-19 20:39:40,114 INFO L413 NwaCegarLoop]: 843 mSDtfsCounter, 2631 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2675 SdHoareTripleChecker+Valid, 2449 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:40,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2675 Valid, 2449 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 20:39:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2022-07-19 20:39:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2761. [2022-07-19 20:39:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2196 states have (on average 1.284608378870674) internal successors, (2821), 2232 states have internal predecessors, (2821), 303 states have call successors, (303), 190 states have call predecessors, (303), 260 states have return successors, (420), 341 states have call predecessors, (420), 299 states have call successors, (420) [2022-07-19 20:39:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3544 transitions. [2022-07-19 20:39:40,196 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3544 transitions. Word has length 92 [2022-07-19 20:39:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:40,197 INFO L495 AbstractCegarLoop]: Abstraction has 2761 states and 3544 transitions. [2022-07-19 20:39:40,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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) [2022-07-19 20:39:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3544 transitions. [2022-07-19 20:39:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-19 20:39:40,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:40,200 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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] [2022-07-19 20:39:40,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 20:39:40,201 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:40,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1207382224, now seen corresponding path program 1 times [2022-07-19 20:39:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:40,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867380357] [2022-07-19 20:39:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 20:39:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:39:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 20:39:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 20:39:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 20:39:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:39:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:39:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 20:39:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 20:39:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-19 20:39:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 20:39:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-19 20:39:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:40,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867380357] [2022-07-19 20:39:40,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867380357] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:39:40,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144567887] [2022-07-19 20:39:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:40,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:39:40,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:39:40,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:39:40,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 20:39:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:40,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:39:40,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:39:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 20:39:40,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:39:40,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144567887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:40,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:39:40,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-19 20:39:40,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772907889] [2022-07-19 20:39:40,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:40,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:39:40,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:40,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:39:40,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:40,556 INFO L87 Difference]: Start difference. First operand 2761 states and 3544 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-19 20:39:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:40,702 INFO L93 Difference]: Finished difference Result 7086 states and 8859 transitions. [2022-07-19 20:39:40,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:39:40,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2022-07-19 20:39:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:40,716 INFO L225 Difference]: With dead ends: 7086 [2022-07-19 20:39:40,716 INFO L226 Difference]: Without dead ends: 4898 [2022-07-19 20:39:40,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:40,720 INFO L413 NwaCegarLoop]: 801 mSDtfsCounter, 61 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:40,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1569 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 20:39:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2022-07-19 20:39:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 4853. [2022-07-19 20:39:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3821 states have (on average 1.248102590944779) internal successors, (4769), 3886 states have internal predecessors, (4769), 537 states have call successors, (537), 372 states have call predecessors, (537), 493 states have return successors, (727), 597 states have call predecessors, (727), 533 states have call successors, (727) [2022-07-19 20:39:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6033 transitions. [2022-07-19 20:39:40,871 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6033 transitions. Word has length 163 [2022-07-19 20:39:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:40,872 INFO L495 AbstractCegarLoop]: Abstraction has 4853 states and 6033 transitions. [2022-07-19 20:39:40,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-19 20:39:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6033 transitions. [2022-07-19 20:39:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-19 20:39:40,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:40,876 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 20:39:40,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 20:39:41,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 20:39:41,095 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:41,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash -207723447, now seen corresponding path program 1 times [2022-07-19 20:39:41,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:41,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993259985] [2022-07-19 20:39:41,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:41,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 20:39:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:39:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 20:39:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 20:39:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 20:39:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:39:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 20:39:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 20:39:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 20:39:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:39:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 20:39:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 20:39:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-19 20:39:41,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:41,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993259985] [2022-07-19 20:39:41,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993259985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:39:41,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230075914] [2022-07-19 20:39:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:41,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:39:41,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:39:41,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:39:41,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 20:39:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:41,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:39:41,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:39:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-19 20:39:41,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:39:41,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230075914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:41,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:39:41,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-19 20:39:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043341449] [2022-07-19 20:39:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:41,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:39:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:41,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:39:41,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:41,509 INFO L87 Difference]: Start difference. First operand 4853 states and 6033 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 20:39:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:41,695 INFO L93 Difference]: Finished difference Result 13721 states and 16771 transitions. [2022-07-19 20:39:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:39:41,696 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), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 195 [2022-07-19 20:39:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:41,731 INFO L225 Difference]: With dead ends: 13721 [2022-07-19 20:39:41,731 INFO L226 Difference]: Without dead ends: 9287 [2022-07-19 20:39:41,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:41,762 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 52 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:41,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1569 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 20:39:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9287 states. [2022-07-19 20:39:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9287 to 9277. [2022-07-19 20:39:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9277 states, 7258 states have (on average 1.2241664370349958) internal successors, (8885), 7383 states have internal predecessors, (8885), 1037 states have call successors, (1037), 736 states have call predecessors, (1037), 980 states have return successors, (1420), 1160 states have call predecessors, (1420), 1033 states have call successors, (1420) [2022-07-19 20:39:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9277 states to 9277 states and 11342 transitions. [2022-07-19 20:39:42,110 INFO L78 Accepts]: Start accepts. Automaton has 9277 states and 11342 transitions. Word has length 195 [2022-07-19 20:39:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:42,110 INFO L495 AbstractCegarLoop]: Abstraction has 9277 states and 11342 transitions. [2022-07-19 20:39:42,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 20:39:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 9277 states and 11342 transitions. [2022-07-19 20:39:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-19 20:39:42,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:42,116 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 20:39:42,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 20:39:42,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-19 20:39:42,327 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:42,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1105116725, now seen corresponding path program 1 times [2022-07-19 20:39:42,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:42,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402130394] [2022-07-19 20:39:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:42,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 20:39:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:39:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 20:39:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:39:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 20:39:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 20:39:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 20:39:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 20:39:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 20:39:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 20:39:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 20:39:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 20:39:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 20:39:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:39:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 20:39:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 20:39:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-19 20:39:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:42,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402130394] [2022-07-19 20:39:42,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402130394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:39:42,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205876993] [2022-07-19 20:39:42,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:42,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:39:42,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:39:42,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:39:42,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 20:39:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:42,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:39:42,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:39:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-19 20:39:42,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:39:42,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205876993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:42,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:39:42,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-19 20:39:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88792919] [2022-07-19 20:39:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:42,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:39:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:42,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:39:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:42,727 INFO L87 Difference]: Start difference. First operand 9277 states and 11342 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-19 20:39:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:42,980 INFO L93 Difference]: Finished difference Result 15807 states and 19582 transitions. [2022-07-19 20:39:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:39:42,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 195 [2022-07-19 20:39:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:42,986 INFO L225 Difference]: With dead ends: 15807 [2022-07-19 20:39:42,986 INFO L226 Difference]: Without dead ends: 408 [2022-07-19 20:39:43,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:43,007 INFO L413 NwaCegarLoop]: 773 mSDtfsCounter, 669 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:43,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 773 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 20:39:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-19 20:39:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2022-07-19 20:39:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 374 states have internal predecessors, (589), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-19 20:39:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 645 transitions. [2022-07-19 20:39:43,017 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 645 transitions. Word has length 195 [2022-07-19 20:39:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:43,017 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 645 transitions. [2022-07-19 20:39:43,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-19 20:39:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 645 transitions. [2022-07-19 20:39:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:39:43,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:43,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:39:43,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 20:39:43,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:39:43,232 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash -397337084, now seen corresponding path program 1 times [2022-07-19 20:39:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:43,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208610357] [2022-07-19 20:39:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:39:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:39:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:43,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:39:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:43,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:39:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:43,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:43,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208610357] [2022-07-19 20:39:43,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208610357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:43,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:43,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 20:39:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876032379] [2022-07-19 20:39:43,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:43,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:39:43,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:43,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:39:43,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:39:43,344 INFO L87 Difference]: Start difference. First operand 408 states and 645 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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) [2022-07-19 20:39:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:44,546 INFO L93 Difference]: Finished difference Result 957 states and 1535 transitions. [2022-07-19 20:39:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 20:39:44,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 190 [2022-07-19 20:39:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:44,567 INFO L225 Difference]: With dead ends: 957 [2022-07-19 20:39:44,568 INFO L226 Difference]: Without dead ends: 561 [2022-07-19 20:39:44,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:39:44,569 INFO L413 NwaCegarLoop]: 711 mSDtfsCounter, 1110 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:44,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1139 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 20:39:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-07-19 20:39:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 408. [2022-07-19 20:39:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 372 states have (on average 1.5806451612903225) internal successors, (588), 374 states have internal predecessors, (588), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-19 20:39:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 644 transitions. [2022-07-19 20:39:44,586 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 644 transitions. Word has length 190 [2022-07-19 20:39:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:44,587 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 644 transitions. [2022-07-19 20:39:44,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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) [2022-07-19 20:39:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 644 transitions. [2022-07-19 20:39:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:39:44,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:44,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:39:44,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 20:39:44,589 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:44,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1996486142, now seen corresponding path program 1 times [2022-07-19 20:39:44,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:44,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306423262] [2022-07-19 20:39:44,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:44,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:39:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:39:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:44,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:39:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:39:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:44,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306423262] [2022-07-19 20:39:44,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306423262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:44,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:44,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 20:39:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657072871] [2022-07-19 20:39:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:44,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:39:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:39:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:39:44,698 INFO L87 Difference]: Start difference. First operand 408 states and 644 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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) [2022-07-19 20:39:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:45,917 INFO L93 Difference]: Finished difference Result 949 states and 1518 transitions. [2022-07-19 20:39:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 20:39:45,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 190 [2022-07-19 20:39:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:45,920 INFO L225 Difference]: With dead ends: 949 [2022-07-19 20:39:45,920 INFO L226 Difference]: Without dead ends: 561 [2022-07-19 20:39:45,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:39:45,922 INFO L413 NwaCegarLoop]: 710 mSDtfsCounter, 1101 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:45,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1137 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 20:39:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-07-19 20:39:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 408. [2022-07-19 20:39:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 372 states have (on average 1.5779569892473118) internal successors, (587), 374 states have internal predecessors, (587), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-19 20:39:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 643 transitions. [2022-07-19 20:39:45,944 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 643 transitions. Word has length 190 [2022-07-19 20:39:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:45,944 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 643 transitions. [2022-07-19 20:39:45,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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) [2022-07-19 20:39:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 643 transitions. [2022-07-19 20:39:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:39:45,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:45,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:39:45,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 20:39:45,947 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2086546432, now seen corresponding path program 1 times [2022-07-19 20:39:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:45,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527397760] [2022-07-19 20:39:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:45,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:39:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:39:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:46,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:39:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:46,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:39:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:46,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:46,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527397760] [2022-07-19 20:39:46,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527397760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:46,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:46,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:39:46,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675183109] [2022-07-19 20:39:46,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:46,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:39:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:46,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:39:46,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:39:46,070 INFO L87 Difference]: Start difference. First operand 408 states and 643 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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) [2022-07-19 20:39:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:48,524 INFO L93 Difference]: Finished difference Result 1506 states and 2426 transitions. [2022-07-19 20:39:48,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 20:39:48,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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 190 [2022-07-19 20:39:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:48,527 INFO L225 Difference]: With dead ends: 1506 [2022-07-19 20:39:48,527 INFO L226 Difference]: Without dead ends: 1120 [2022-07-19 20:39:48,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:48,528 INFO L413 NwaCegarLoop]: 819 mSDtfsCounter, 1682 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:48,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 1960 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 20:39:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2022-07-19 20:39:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 813. [2022-07-19 20:39:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 748 states have (on average 1.5909090909090908) internal successors, (1190), 751 states have internal predecessors, (1190), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2022-07-19 20:39:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1293 transitions. [2022-07-19 20:39:48,565 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1293 transitions. Word has length 190 [2022-07-19 20:39:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:48,565 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1293 transitions. [2022-07-19 20:39:48,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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) [2022-07-19 20:39:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1293 transitions. [2022-07-19 20:39:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:39:48,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:48,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:39:48,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 20:39:48,567 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash 361394428, now seen corresponding path program 1 times [2022-07-19 20:39:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:48,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292847793] [2022-07-19 20:39:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:48,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:39:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:48,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:39:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:39:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:39:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:48,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292847793] [2022-07-19 20:39:48,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292847793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:48,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:48,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:39:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789741893] [2022-07-19 20:39:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:48,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:39:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:39:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:39:48,695 INFO L87 Difference]: Start difference. First operand 813 states and 1293 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:39:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:51,647 INFO L93 Difference]: Finished difference Result 2490 states and 4021 transitions. [2022-07-19 20:39:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:39:51,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:39:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:51,662 INFO L225 Difference]: With dead ends: 2490 [2022-07-19 20:39:51,662 INFO L226 Difference]: Without dead ends: 1699 [2022-07-19 20:39:51,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:39:51,664 INFO L413 NwaCegarLoop]: 838 mSDtfsCounter, 1826 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 3006 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 3006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:51,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 2231 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 3006 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 20:39:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-07-19 20:39:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1189. [2022-07-19 20:39:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1095 states have (on average 1.5844748858447488) internal successors, (1735), 1099 states have internal predecessors, (1735), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2022-07-19 20:39:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1884 transitions. [2022-07-19 20:39:51,721 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1884 transitions. Word has length 190 [2022-07-19 20:39:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:51,722 INFO L495 AbstractCegarLoop]: Abstraction has 1189 states and 1884 transitions. [2022-07-19 20:39:51,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:39:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1884 transitions. [2022-07-19 20:39:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:39:51,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:51,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:39:51,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 20:39:51,724 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:51,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1561856002, now seen corresponding path program 1 times [2022-07-19 20:39:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:51,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804891117] [2022-07-19 20:39:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:39:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:39:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:39:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:51,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:39:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:51,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:51,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804891117] [2022-07-19 20:39:51,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804891117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:51,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:51,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:39:51,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435608166] [2022-07-19 20:39:51,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:51,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:39:51,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:51,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:39:51,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:39:51,846 INFO L87 Difference]: Start difference. First operand 1189 states and 1884 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:39:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:55,005 INFO L93 Difference]: Finished difference Result 3941 states and 6352 transitions. [2022-07-19 20:39:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:39:55,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:39:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:55,013 INFO L225 Difference]: With dead ends: 3941 [2022-07-19 20:39:55,013 INFO L226 Difference]: Without dead ends: 2774 [2022-07-19 20:39:55,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:39:55,018 INFO L413 NwaCegarLoop]: 1087 mSDtfsCounter, 1715 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 3352 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 3442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:55,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 3135 Invalid, 3442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3352 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 20:39:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-07-19 20:39:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1942. [2022-07-19 20:39:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1790 states have (on average 1.5787709497206703) internal successors, (2826), 1796 states have internal predecessors, (2826), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2022-07-19 20:39:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3071 transitions. [2022-07-19 20:39:55,127 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3071 transitions. Word has length 190 [2022-07-19 20:39:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:55,127 INFO L495 AbstractCegarLoop]: Abstraction has 1942 states and 3071 transitions. [2022-07-19 20:39:55,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:39:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3071 transitions. [2022-07-19 20:39:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:39:55,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:55,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:39:55,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 20:39:55,129 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:55,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1008502972, now seen corresponding path program 1 times [2022-07-19 20:39:55,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:55,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031004330] [2022-07-19 20:39:55,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:55,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:39:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:39:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:39:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:39:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:55,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:55,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031004330] [2022-07-19 20:39:55,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031004330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:55,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:55,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:39:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933009991] [2022-07-19 20:39:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:39:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:39:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:39:55,257 INFO L87 Difference]: Start difference. First operand 1942 states and 3071 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:39:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:56,709 INFO L93 Difference]: Finished difference Result 4682 states and 7530 transitions. [2022-07-19 20:39:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:39:56,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:39:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:56,715 INFO L225 Difference]: With dead ends: 4682 [2022-07-19 20:39:56,715 INFO L226 Difference]: Without dead ends: 2762 [2022-07-19 20:39:56,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:56,720 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 1392 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:56,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 1502 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 20:39:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2022-07-19 20:39:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 1942. [2022-07-19 20:39:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1790 states have (on average 1.5759776536312848) internal successors, (2821), 1796 states have internal predecessors, (2821), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2022-07-19 20:39:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3066 transitions. [2022-07-19 20:39:56,826 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3066 transitions. Word has length 190 [2022-07-19 20:39:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:56,827 INFO L495 AbstractCegarLoop]: Abstraction has 1942 states and 3066 transitions. [2022-07-19 20:39:56,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:39:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3066 transitions. [2022-07-19 20:39:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:39:56,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:56,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:39:56,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 20:39:56,829 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1507059774, now seen corresponding path program 1 times [2022-07-19 20:39:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:56,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697302328] [2022-07-19 20:39:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:56,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:56,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:39:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:56,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:39:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:39:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:39:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:56,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:56,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697302328] [2022-07-19 20:39:56,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697302328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:56,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:56,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:39:56,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517430985] [2022-07-19 20:39:56,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:56,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:39:56,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:39:56,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:39:56,961 INFO L87 Difference]: Start difference. First operand 1942 states and 3066 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:39:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:39:58,329 INFO L93 Difference]: Finished difference Result 4676 states and 7504 transitions. [2022-07-19 20:39:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:39:58,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:39:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:39:58,348 INFO L225 Difference]: With dead ends: 4676 [2022-07-19 20:39:58,348 INFO L226 Difference]: Without dead ends: 2756 [2022-07-19 20:39:58,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:39:58,352 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 1393 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:39:58,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 1496 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 20:39:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2022-07-19 20:39:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 1942. [2022-07-19 20:39:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1790 states have (on average 1.5731843575418993) internal successors, (2816), 1796 states have internal predecessors, (2816), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2022-07-19 20:39:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3061 transitions. [2022-07-19 20:39:58,497 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3061 transitions. Word has length 190 [2022-07-19 20:39:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:39:58,498 INFO L495 AbstractCegarLoop]: Abstraction has 1942 states and 3061 transitions. [2022-07-19 20:39:58,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:39:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3061 transitions. [2022-07-19 20:39:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:39:58,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:39:58,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:39:58,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 20:39:58,500 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:39:58,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:39:58,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2077331580, now seen corresponding path program 1 times [2022-07-19 20:39:58,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:39:58,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338838234] [2022-07-19 20:39:58,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:39:58,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:39:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:58,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:39:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:39:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:39:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:58,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:39:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:39:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:39:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:39:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:39:58,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338838234] [2022-07-19 20:39:58,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338838234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:39:58,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:39:58,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:39:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862755313] [2022-07-19 20:39:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:39:58,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:39:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:39:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:39:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:39:58,626 INFO L87 Difference]: Start difference. First operand 1942 states and 3061 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:40:01,764 INFO L93 Difference]: Finished difference Result 6711 states and 10723 transitions. [2022-07-19 20:40:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:40:01,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:40:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:40:01,774 INFO L225 Difference]: With dead ends: 6711 [2022-07-19 20:40:01,775 INFO L226 Difference]: Without dead ends: 4791 [2022-07-19 20:40:01,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:40:01,778 INFO L413 NwaCegarLoop]: 1063 mSDtfsCounter, 1693 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:40:01,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 3111 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3301 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 20:40:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2022-07-19 20:40:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 3462. [2022-07-19 20:40:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3462 states, 3194 states have (on average 1.5685660613650594) internal successors, (5010), 3204 states have internal predecessors, (5010), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2022-07-19 20:40:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 5453 transitions. [2022-07-19 20:40:02,053 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 5453 transitions. Word has length 190 [2022-07-19 20:40:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:40:02,053 INFO L495 AbstractCegarLoop]: Abstraction has 3462 states and 5453 transitions. [2022-07-19 20:40:02,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 5453 transitions. [2022-07-19 20:40:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:40:02,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:40:02,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:40:02,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 20:40:02,056 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:40:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:40:02,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1291333690, now seen corresponding path program 1 times [2022-07-19 20:40:02,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:40:02,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526590909] [2022-07-19 20:40:02,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:40:02,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:40:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:40:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:02,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:40:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:40:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:40:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:40:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:40:02,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:40:02,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526590909] [2022-07-19 20:40:02,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526590909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:40:02,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:40:02,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:40:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687299760] [2022-07-19 20:40:02,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:40:02,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:40:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:40:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:40:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:40:02,175 INFO L87 Difference]: Start difference. First operand 3462 states and 5453 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:40:05,700 INFO L93 Difference]: Finished difference Result 12289 states and 19601 transitions. [2022-07-19 20:40:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:40:05,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:40:05,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:40:05,721 INFO L225 Difference]: With dead ends: 12289 [2022-07-19 20:40:05,721 INFO L226 Difference]: Without dead ends: 8849 [2022-07-19 20:40:05,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:40:05,728 INFO L413 NwaCegarLoop]: 1058 mSDtfsCounter, 1692 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 3387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:40:05,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 3106 Invalid, 3387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 20:40:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8849 states. [2022-07-19 20:40:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8849 to 6503. [2022-07-19 20:40:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6503 states, 6003 states have (on average 1.565217391304348) internal successors, (9396), 6021 states have internal predecessors, (9396), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2022-07-19 20:40:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 10253 transitions. [2022-07-19 20:40:06,253 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 10253 transitions. Word has length 190 [2022-07-19 20:40:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:40:06,253 INFO L495 AbstractCegarLoop]: Abstraction has 6503 states and 10253 transitions. [2022-07-19 20:40:06,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 10253 transitions. [2022-07-19 20:40:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:40:06,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:40:06,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:40:06,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 20:40:06,258 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:40:06,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:40:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1958715580, now seen corresponding path program 1 times [2022-07-19 20:40:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:40:06,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039653773] [2022-07-19 20:40:06,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:40:06,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:40:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:06,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:40:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:06,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:40:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:40:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:06,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:40:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:40:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:40:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:40:06,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039653773] [2022-07-19 20:40:06,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039653773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:40:06,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:40:06,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:40:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767283959] [2022-07-19 20:40:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:40:06,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:40:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:40:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:40:06,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:40:06,363 INFO L87 Difference]: Start difference. First operand 6503 states and 10253 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:40:10,590 INFO L93 Difference]: Finished difference Result 23440 states and 37407 transitions. [2022-07-19 20:40:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:40:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:40:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:40:10,680 INFO L225 Difference]: With dead ends: 23440 [2022-07-19 20:40:10,681 INFO L226 Difference]: Without dead ends: 16959 [2022-07-19 20:40:10,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:40:10,692 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 1691 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 3285 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 3101 SdHoareTripleChecker+Invalid, 3379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:40:10,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 3101 Invalid, 3379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3285 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 20:40:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16959 states. [2022-07-19 20:40:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16959 to 12600. [2022-07-19 20:40:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12600 states, 11636 states have (on average 1.5632519766242694) internal successors, (18190), 11670 states have internal predecessors, (18190), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2022-07-19 20:40:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12600 states to 12600 states and 19929 transitions. [2022-07-19 20:40:11,673 INFO L78 Accepts]: Start accepts. Automaton has 12600 states and 19929 transitions. Word has length 190 [2022-07-19 20:40:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:40:11,675 INFO L495 AbstractCegarLoop]: Abstraction has 12600 states and 19929 transitions. [2022-07-19 20:40:11,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 12600 states and 19929 transitions. [2022-07-19 20:40:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:40:11,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:40:11,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:40:11,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 20:40:11,684 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:40:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:40:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash -236513286, now seen corresponding path program 1 times [2022-07-19 20:40:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:40:11,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389426865] [2022-07-19 20:40:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:40:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:40:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:11,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:40:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:40:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:40:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:40:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:40:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:40:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:40:11,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389426865] [2022-07-19 20:40:11,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389426865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:40:11,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:40:11,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:40:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742485133] [2022-07-19 20:40:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:40:11,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:40:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:40:11,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:40:11,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:40:11,805 INFO L87 Difference]: Start difference. First operand 12600 states and 19929 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:40:14,531 INFO L93 Difference]: Finished difference Result 29786 states and 47788 transitions. [2022-07-19 20:40:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:40:14,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:40:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:40:14,570 INFO L225 Difference]: With dead ends: 29786 [2022-07-19 20:40:14,570 INFO L226 Difference]: Without dead ends: 17208 [2022-07-19 20:40:14,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:40:14,589 INFO L413 NwaCegarLoop]: 639 mSDtfsCounter, 1466 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:40:14,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1443 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 20:40:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17208 states. [2022-07-19 20:40:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17208 to 12600. [2022-07-19 20:40:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12600 states, 11636 states have (on average 1.5604159504984532) internal successors, (18157), 11670 states have internal predecessors, (18157), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2022-07-19 20:40:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12600 states to 12600 states and 19896 transitions. [2022-07-19 20:40:15,654 INFO L78 Accepts]: Start accepts. Automaton has 12600 states and 19896 transitions. Word has length 190 [2022-07-19 20:40:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:40:15,654 INFO L495 AbstractCegarLoop]: Abstraction has 12600 states and 19896 transitions. [2022-07-19 20:40:15,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:15,654 INFO L276 IsEmpty]: Start isEmpty. Operand 12600 states and 19896 transitions. [2022-07-19 20:40:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:40:15,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:40:15,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:40:15,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 20:40:15,664 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:40:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:40:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash 108314876, now seen corresponding path program 1 times [2022-07-19 20:40:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:40:15,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65238981] [2022-07-19 20:40:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:40:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:40:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:15,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:40:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:15,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:40:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:15,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:40:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:15,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:40:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:15,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:40:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:40:15,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:40:15,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65238981] [2022-07-19 20:40:15,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65238981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:40:15,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:40:15,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:40:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399724687] [2022-07-19 20:40:15,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:40:15,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:40:15,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:40:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:40:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:40:15,784 INFO L87 Difference]: Start difference. First operand 12600 states and 19896 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:40:21,727 INFO L93 Difference]: Finished difference Result 45709 states and 72981 transitions. [2022-07-19 20:40:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:40:21,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:40:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:40:21,808 INFO L225 Difference]: With dead ends: 45709 [2022-07-19 20:40:21,808 INFO L226 Difference]: Without dead ends: 33131 [2022-07-19 20:40:21,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:40:21,842 INFO L413 NwaCegarLoop]: 1042 mSDtfsCounter, 1683 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 3258 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 3090 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:40:21,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 3090 Invalid, 3352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3258 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 20:40:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33131 states. [2022-07-19 20:40:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33131 to 24858. [2022-07-19 20:40:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24858 states, 22966 states have (on average 1.5585212923452059) internal successors, (35793), 23032 states have internal predecessors, (35793), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2022-07-19 20:40:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24858 states to 24858 states and 39458 transitions. [2022-07-19 20:40:23,974 INFO L78 Accepts]: Start accepts. Automaton has 24858 states and 39458 transitions. Word has length 190 [2022-07-19 20:40:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:40:23,975 INFO L495 AbstractCegarLoop]: Abstraction has 24858 states and 39458 transitions. [2022-07-19 20:40:23,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 24858 states and 39458 transitions. [2022-07-19 20:40:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:40:23,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:40:23,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:40:23,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 20:40:23,985 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:40:23,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:40:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1089269690, now seen corresponding path program 1 times [2022-07-19 20:40:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:40:23,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201544710] [2022-07-19 20:40:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:40:23,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:40:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:24,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:40:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:24,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:40:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:40:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:40:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:24,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:40:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:40:24,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:40:24,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201544710] [2022-07-19 20:40:24,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201544710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:40:24,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:40:24,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:40:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898533587] [2022-07-19 20:40:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:40:24,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:40:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:40:24,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:40:24,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:40:24,100 INFO L87 Difference]: Start difference. First operand 24858 states and 39458 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:40:33,369 INFO L93 Difference]: Finished difference Result 90317 states and 145005 transitions. [2022-07-19 20:40:33,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:40:33,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:40:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:40:33,609 INFO L225 Difference]: With dead ends: 90317 [2022-07-19 20:40:33,609 INFO L226 Difference]: Without dead ends: 65481 [2022-07-19 20:40:33,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:40:33,654 INFO L413 NwaCegarLoop]: 1037 mSDtfsCounter, 1682 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 3250 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:40:33,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 3085 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3250 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 20:40:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65481 states. [2022-07-19 20:40:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65481 to 49435. [2022-07-19 20:40:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49435 states, 45687 states have (on average 1.5574452251187427) internal successors, (71155), 45817 states have internal predecessors, (71155), 2845 states have call successors, (2845), 775 states have call predecessors, (2845), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2022-07-19 20:40:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49435 states to 49435 states and 79158 transitions. [2022-07-19 20:40:38,061 INFO L78 Accepts]: Start accepts. Automaton has 49435 states and 79158 transitions. Word has length 190 [2022-07-19 20:40:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:40:38,062 INFO L495 AbstractCegarLoop]: Abstraction has 49435 states and 79158 transitions. [2022-07-19 20:40:38,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 49435 states and 79158 transitions. [2022-07-19 20:40:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:40:38,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:40:38,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:40:38,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 20:40:38,082 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:40:38,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:40:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash -680201924, now seen corresponding path program 1 times [2022-07-19 20:40:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:40:38,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568597061] [2022-07-19 20:40:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:40:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:40:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:40:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:40:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:38,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:40:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:38,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:40:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:38,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:40:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:40:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:40:38,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:40:38,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568597061] [2022-07-19 20:40:38,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568597061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:40:38,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:40:38,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:40:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947143930] [2022-07-19 20:40:38,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:40:38,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:40:38,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:40:38,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:40:38,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:40:38,195 INFO L87 Difference]: Start difference. First operand 49435 states and 79158 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:40:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:40:54,786 INFO L93 Difference]: Finished difference Result 179532 states and 290899 transitions. [2022-07-19 20:40:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:40:54,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:40:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:40:55,201 INFO L225 Difference]: With dead ends: 179532 [2022-07-19 20:40:55,201 INFO L226 Difference]: Without dead ends: 130119 [2022-07-19 20:40:55,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:40:55,538 INFO L413 NwaCegarLoop]: 1030 mSDtfsCounter, 1684 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 3239 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 3336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:40:55,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 3078 Invalid, 3336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3239 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 20:40:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130119 states. [2022-07-19 20:41:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130119 to 98716. [2022-07-19 20:41:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98716 states, 91256 states have (on average 1.5568181818181819) internal successors, (142069), 91514 states have internal predecessors, (142069), 5661 states have call successors, (5661), 1543 states have call predecessors, (5661), 1798 states have return successors, (12476), 5914 states have call predecessors, (12476), 5659 states have call successors, (12476) [2022-07-19 20:41:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98716 states to 98716 states and 160206 transitions. [2022-07-19 20:41:04,775 INFO L78 Accepts]: Start accepts. Automaton has 98716 states and 160206 transitions. Word has length 190 [2022-07-19 20:41:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:41:04,775 INFO L495 AbstractCegarLoop]: Abstraction has 98716 states and 160206 transitions. [2022-07-19 20:41:04,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:41:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 98716 states and 160206 transitions. [2022-07-19 20:41:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:41:04,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:41:04,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:41:04,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 20:41:04,809 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:41:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:41:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1291470982, now seen corresponding path program 1 times [2022-07-19 20:41:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:41:04,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518587641] [2022-07-19 20:41:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:41:04,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:41:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:04,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:41:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:41:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:41:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:41:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:41:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:41:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:41:04,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518587641] [2022-07-19 20:41:04,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518587641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:41:04,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:41:04,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:41:04,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677529469] [2022-07-19 20:41:04,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:41:04,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:41:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:41:04,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:41:04,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:41:04,915 INFO L87 Difference]: Start difference. First operand 98716 states and 160206 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:41:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:41:21,059 INFO L93 Difference]: Finished difference Result 230424 states and 381359 transitions. [2022-07-19 20:41:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:41:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2022-07-19 20:41:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:41:21,727 INFO L225 Difference]: With dead ends: 230424 [2022-07-19 20:41:21,727 INFO L226 Difference]: Without dead ends: 131730 [2022-07-19 20:41:22,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:41:22,076 INFO L413 NwaCegarLoop]: 660 mSDtfsCounter, 1392 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:41:22,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 1462 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 20:41:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131730 states. [2022-07-19 20:41:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131730 to 98716. [2022-07-19 20:41:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98716 states, 91256 states have (on average 1.5540019286403086) internal successors, (141812), 91514 states have internal predecessors, (141812), 5661 states have call successors, (5661), 1543 states have call predecessors, (5661), 1798 states have return successors, (12476), 5914 states have call predecessors, (12476), 5659 states have call successors, (12476) [2022-07-19 20:41:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98716 states to 98716 states and 159949 transitions. [2022-07-19 20:41:32,132 INFO L78 Accepts]: Start accepts. Automaton has 98716 states and 159949 transitions. Word has length 190 [2022-07-19 20:41:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:41:32,132 INFO L495 AbstractCegarLoop]: Abstraction has 98716 states and 159949 transitions. [2022-07-19 20:41:32,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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) [2022-07-19 20:41:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 98716 states and 159949 transitions. [2022-07-19 20:41:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 20:41:32,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:41:32,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:41:32,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 20:41:32,164 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:41:32,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:41:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash 602862904, now seen corresponding path program 1 times [2022-07-19 20:41:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:41:32,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30267406] [2022-07-19 20:41:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:41:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:41:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:32,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:41:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:41:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:32,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 20:41:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:32,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 20:41:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:32,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 20:41:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:41:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:41:32,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:41:32,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30267406] [2022-07-19 20:41:32,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30267406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:41:32,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:41:32,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:41:32,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937532185] [2022-07-19 20:41:32,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:41:32,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:41:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:41:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:41:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:41:32,277 INFO L87 Difference]: Start difference. First operand 98716 states and 159949 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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)