./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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_2.cil-1+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 21:04:25,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 21:04:25,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 21:04:25,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 21:04:25,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 21:04:25,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 21:04:25,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 21:04:25,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 21:04:25,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 21:04:25,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 21:04:25,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 21:04:25,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 21:04:25,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 21:04:25,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 21:04:25,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 21:04:25,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 21:04:25,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 21:04:25,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 21:04:25,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 21:04:25,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 21:04:25,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 21:04:25,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 21:04:25,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 21:04:25,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 21:04:25,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 21:04:25,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 21:04:25,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 21:04:25,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 21:04:25,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 21:04:25,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 21:04:25,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 21:04:25,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 21:04:25,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 21:04:25,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 21:04:25,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 21:04:25,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 21:04:25,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 21:04:25,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 21:04:25,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 21:04:25,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 21:04:25,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 21:04:25,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 21:04:26,003 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 21:04:26,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 21:04:26,004 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 21:04:26,004 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 21:04:26,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 21:04:26,005 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 21:04:26,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 21:04:26,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 21:04:26,006 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 21:04:26,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 21:04:26,007 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 21:04:26,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 21:04:26,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 21:04:26,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 21:04:26,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 21:04:26,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 21:04:26,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 21:04:26,008 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 21:04:26,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 21:04:26,008 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 21:04:26,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 21:04:26,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 21:04:26,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 21:04:26,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 21:04:26,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:04:26,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 21:04:26,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 21:04:26,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 21:04:26,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 21:04:26,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 21:04:26,010 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 21:04:26,010 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 21:04:26,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 21:04:26,011 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 21:04:26,011 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 -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2021-12-17 21:04:26,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 21:04:26,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 21:04:26,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 21:04:26,225 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 21:04:26,225 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 21:04:26,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-17 21:04:26,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02f8211/7eea7decb2d24c2dae9e1b3562760227/FLAG2286b7f45 [2021-12-17 21:04:26,623 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 21:04:26,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-17 21:04:26,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02f8211/7eea7decb2d24c2dae9e1b3562760227/FLAG2286b7f45 [2021-12-17 21:04:26,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02f8211/7eea7decb2d24c2dae9e1b3562760227 [2021-12-17 21:04:26,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 21:04:26,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 21:04:26,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 21:04:26,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 21:04:26,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 21:04:26,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:26,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495167fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26, skipping insertion in model container [2021-12-17 21:04:26,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:26,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 21:04:26,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 21:04:26,825 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_2.cil-1+token_ring.01.cil-2.c[914,927] [2021-12-17 21:04:26,869 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_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2021-12-17 21:04:26,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:04:26,912 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 21:04:26,923 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_2.cil-1+token_ring.01.cil-2.c[914,927] [2021-12-17 21:04:26,944 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_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2021-12-17 21:04:26,967 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:04:26,980 INFO L208 MainTranslator]: Completed translation [2021-12-17 21:04:26,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26 WrapperNode [2021-12-17 21:04:26,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 21:04:26,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 21:04:26,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 21:04:26,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 21:04:26,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,043 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 407 [2021-12-17 21:04:27,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 21:04:27,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 21:04:27,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 21:04:27,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 21:04:27,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 21:04:27,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 21:04:27,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 21:04:27,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 21:04:27,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (1/1) ... [2021-12-17 21:04:27,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:04:27,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:04:27,121 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) [2021-12-17 21:04:27,131 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 [2021-12-17 21:04:27,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 21:04:27,148 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-17 21:04:27,148 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-17 21:04:27,148 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-17 21:04:27,149 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-17 21:04:27,149 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-17 21:04:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-17 21:04:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-17 21:04:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-17 21:04:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-17 21:04:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-17 21:04:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-17 21:04:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-17 21:04:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-17 21:04:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-17 21:04:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-17 21:04:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-17 21:04:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-17 21:04:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-17 21:04:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-17 21:04:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-17 21:04:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-17 21:04:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-17 21:04:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 21:04:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-17 21:04:27,151 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-17 21:04:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-17 21:04:27,151 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-17 21:04:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 21:04:27,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 21:04:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-17 21:04:27,151 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-17 21:04:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-17 21:04:27,151 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-17 21:04:27,246 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 21:04:27,248 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 21:04:27,576 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 21:04:27,582 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 21:04:27,582 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-17 21:04:27,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:04:27 BoogieIcfgContainer [2021-12-17 21:04:27,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 21:04:27,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 21:04:27,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 21:04:27,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 21:04:27,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:04:26" (1/3) ... [2021-12-17 21:04:27,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48403d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:04:27, skipping insertion in model container [2021-12-17 21:04:27,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:26" (2/3) ... [2021-12-17 21:04:27,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48403d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:04:27, skipping insertion in model container [2021-12-17 21:04:27,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:04:27" (3/3) ... [2021-12-17 21:04:27,588 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2021-12-17 21:04:27,592 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 21:04:27,592 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 21:04:27,629 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 21:04:27,635 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 21:04:27,635 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 21:04:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-17 21:04:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 21:04:27,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:27,665 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:27,666 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2021-12-17 21:04:27,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:27,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383728222] [2021-12-17 21:04:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:27,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:27,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:27,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:27,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383728222] [2021-12-17 21:04:27,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383728222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:27,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:27,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:27,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578061149] [2021-12-17 21:04:27,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:27,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:27,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:27,971 INFO L87 Difference]: Start difference. First operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2021-12-17 21:04:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:28,627 INFO L93 Difference]: Finished difference Result 552 states and 832 transitions. [2021-12-17 21:04:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:04:28,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2021-12-17 21:04:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:28,638 INFO L225 Difference]: With dead ends: 552 [2021-12-17 21:04:28,638 INFO L226 Difference]: Without dead ends: 343 [2021-12-17 21:04:28,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:04:28,644 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 535 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:28,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 823 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:04:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-12-17 21:04:28,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2021-12-17 21:04:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2021-12-17 21:04:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2021-12-17 21:04:28,692 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 58 [2021-12-17 21:04:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:28,693 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2021-12-17 21:04:28,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2021-12-17 21:04:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2021-12-17 21:04:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 21:04:28,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:28,695 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:28,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 21:04:28,696 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2021-12-17 21:04:28,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:28,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827764335] [2021-12-17 21:04:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:28,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:28,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:28,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:28,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:28,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827764335] [2021-12-17 21:04:28,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827764335] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:28,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:28,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:28,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735867188] [2021-12-17 21:04:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:28,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:28,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:28,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:28,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:28,823 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-12-17 21:04:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:29,387 INFO L93 Difference]: Finished difference Result 651 states and 934 transitions. [2021-12-17 21:04:29,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 21:04:29,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2021-12-17 21:04:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:29,391 INFO L225 Difference]: With dead ends: 651 [2021-12-17 21:04:29,391 INFO L226 Difference]: Without dead ends: 456 [2021-12-17 21:04:29,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 21:04:29,394 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 527 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:29,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 946 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-12-17 21:04:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2021-12-17 21:04:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-17 21:04:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2021-12-17 21:04:29,430 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 58 [2021-12-17 21:04:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:29,430 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2021-12-17 21:04:29,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-12-17 21:04:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2021-12-17 21:04:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 21:04:29,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:29,435 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:29,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 21:04:29,436 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2021-12-17 21:04:29,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:29,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767452597] [2021-12-17 21:04:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:29,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:29,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:29,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:29,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:29,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:29,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767452597] [2021-12-17 21:04:29,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767452597] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:29,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:29,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:29,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518369612] [2021-12-17 21:04:29,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:29,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:29,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:29,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:29,508 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-12-17 21:04:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:30,067 INFO L93 Difference]: Finished difference Result 1002 states and 1431 transitions. [2021-12-17 21:04:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 21:04:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2021-12-17 21:04:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:30,071 INFO L225 Difference]: With dead ends: 1002 [2021-12-17 21:04:30,071 INFO L226 Difference]: Without dead ends: 717 [2021-12-17 21:04:30,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:04:30,073 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 530 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:30,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1163 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-17 21:04:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 565. [2021-12-17 21:04:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2021-12-17 21:04:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 804 transitions. [2021-12-17 21:04:30,100 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 804 transitions. Word has length 58 [2021-12-17 21:04:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:30,101 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 804 transitions. [2021-12-17 21:04:30,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-12-17 21:04:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 804 transitions. [2021-12-17 21:04:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 21:04:30,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:30,103 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:30,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 21:04:30,103 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:30,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash 881620488, now seen corresponding path program 1 times [2021-12-17 21:04:30,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:30,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038923551] [2021-12-17 21:04:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:30,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:30,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038923551] [2021-12-17 21:04:30,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038923551] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:30,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:30,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:30,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644892403] [2021-12-17 21:04:30,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:30,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:30,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:30,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:30,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:30,173 INFO L87 Difference]: Start difference. First operand 565 states and 804 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-12-17 21:04:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:30,592 INFO L93 Difference]: Finished difference Result 1182 states and 1716 transitions. [2021-12-17 21:04:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:04:30,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2021-12-17 21:04:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:30,598 INFO L225 Difference]: With dead ends: 1182 [2021-12-17 21:04:30,598 INFO L226 Difference]: Without dead ends: 723 [2021-12-17 21:04:30,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-17 21:04:30,607 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 271 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:30,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 1086 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-12-17 21:04:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 580. [2021-12-17 21:04:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2021-12-17 21:04:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 819 transitions. [2021-12-17 21:04:30,648 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 819 transitions. Word has length 58 [2021-12-17 21:04:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:30,650 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 819 transitions. [2021-12-17 21:04:30,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-12-17 21:04:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 819 transitions. [2021-12-17 21:04:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 21:04:30,652 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:30,652 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:30,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 21:04:30,652 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1362362810, now seen corresponding path program 1 times [2021-12-17 21:04:30,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:30,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653243040] [2021-12-17 21:04:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:30,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:30,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:30,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653243040] [2021-12-17 21:04:30,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653243040] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:30,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:30,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:30,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657587141] [2021-12-17 21:04:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:30,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:30,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:30,763 INFO L87 Difference]: Start difference. First operand 580 states and 819 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2021-12-17 21:04:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:31,197 INFO L93 Difference]: Finished difference Result 1659 states and 2360 transitions. [2021-12-17 21:04:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:04:31,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2021-12-17 21:04:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:31,202 INFO L225 Difference]: With dead ends: 1659 [2021-12-17 21:04:31,202 INFO L226 Difference]: Without dead ends: 1185 [2021-12-17 21:04:31,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-17 21:04:31,205 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 673 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:31,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 901 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2021-12-17 21:04:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1020. [2021-12-17 21:04:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 828 states have (on average 1.4275362318840579) internal successors, (1182), 841 states have internal predecessors, (1182), 115 states have call successors, (115), 69 states have call predecessors, (115), 75 states have return successors, (134), 114 states have call predecessors, (134), 111 states have call successors, (134) [2021-12-17 21:04:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1431 transitions. [2021-12-17 21:04:31,244 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1431 transitions. Word has length 58 [2021-12-17 21:04:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:31,245 INFO L470 AbstractCegarLoop]: Abstraction has 1020 states and 1431 transitions. [2021-12-17 21:04:31,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2021-12-17 21:04:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1431 transitions. [2021-12-17 21:04:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 21:04:31,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:31,246 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:31,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 21:04:31,246 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash -443388187, now seen corresponding path program 1 times [2021-12-17 21:04:31,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:31,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780748394] [2021-12-17 21:04:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:31,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:31,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:31,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780748394] [2021-12-17 21:04:31,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780748394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:31,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:31,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:31,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040701807] [2021-12-17 21:04:31,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:31,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:31,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:31,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:31,341 INFO L87 Difference]: Start difference. First operand 1020 states and 1431 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-12-17 21:04:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:31,750 INFO L93 Difference]: Finished difference Result 2145 states and 3046 transitions. [2021-12-17 21:04:31,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 21:04:31,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2021-12-17 21:04:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:31,756 INFO L225 Difference]: With dead ends: 2145 [2021-12-17 21:04:31,757 INFO L226 Difference]: Without dead ends: 1231 [2021-12-17 21:04:31,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-17 21:04:31,760 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 237 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:31,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 1064 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2021-12-17 21:04:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1035. [2021-12-17 21:04:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 843 states have (on average 1.4139976275207593) internal successors, (1192), 856 states have internal predecessors, (1192), 115 states have call successors, (115), 69 states have call predecessors, (115), 75 states have return successors, (134), 114 states have call predecessors, (134), 111 states have call successors, (134) [2021-12-17 21:04:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1441 transitions. [2021-12-17 21:04:31,801 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1441 transitions. Word has length 58 [2021-12-17 21:04:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:31,802 INFO L470 AbstractCegarLoop]: Abstraction has 1035 states and 1441 transitions. [2021-12-17 21:04:31,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2021-12-17 21:04:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1441 transitions. [2021-12-17 21:04:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 21:04:31,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:31,806 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:31,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 21:04:31,807 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash -952861277, now seen corresponding path program 1 times [2021-12-17 21:04:31,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:31,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861463881] [2021-12-17 21:04:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:31,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:31,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:31,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861463881] [2021-12-17 21:04:31,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861463881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:31,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:31,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:31,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032327147] [2021-12-17 21:04:31,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:31,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:31,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:31,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:31,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:31,883 INFO L87 Difference]: Start difference. First operand 1035 states and 1441 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:32,437 INFO L93 Difference]: Finished difference Result 1799 states and 2475 transitions. [2021-12-17 21:04:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:04:32,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-17 21:04:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:32,443 INFO L225 Difference]: With dead ends: 1799 [2021-12-17 21:04:32,443 INFO L226 Difference]: Without dead ends: 1223 [2021-12-17 21:04:32,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-12-17 21:04:32,445 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 599 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:32,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 1019 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2021-12-17 21:04:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 941. [2021-12-17 21:04:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 767 states have (on average 1.4054758800521512) internal successors, (1078), 777 states have internal predecessors, (1078), 106 states have call successors, (106), 63 states have call predecessors, (106), 66 states have return successors, (111), 103 states have call predecessors, (111), 102 states have call successors, (111) [2021-12-17 21:04:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1295 transitions. [2021-12-17 21:04:32,477 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1295 transitions. Word has length 58 [2021-12-17 21:04:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:32,478 INFO L470 AbstractCegarLoop]: Abstraction has 941 states and 1295 transitions. [2021-12-17 21:04:32,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1295 transitions. [2021-12-17 21:04:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 21:04:32,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:32,479 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:32,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 21:04:32,479 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash -734006559, now seen corresponding path program 1 times [2021-12-17 21:04:32,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:32,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415124227] [2021-12-17 21:04:32,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:32,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:32,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:32,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:32,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415124227] [2021-12-17 21:04:32,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415124227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:32,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:32,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:32,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530344728] [2021-12-17 21:04:32,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:32,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:32,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:32,552 INFO L87 Difference]: Start difference. First operand 941 states and 1295 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:33,097 INFO L93 Difference]: Finished difference Result 2630 states and 3585 transitions. [2021-12-17 21:04:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:04:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-17 21:04:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:33,104 INFO L225 Difference]: With dead ends: 2630 [2021-12-17 21:04:33,104 INFO L226 Difference]: Without dead ends: 1793 [2021-12-17 21:04:33,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-12-17 21:04:33,106 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 581 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:33,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [598 Valid, 1023 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2021-12-17 21:04:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1404. [2021-12-17 21:04:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1141 states have (on average 1.3698510078878177) internal successors, (1563), 1160 states have internal predecessors, (1563), 154 states have call successors, (154), 95 states have call predecessors, (154), 107 states have return successors, (179), 153 states have call predecessors, (179), 150 states have call successors, (179) [2021-12-17 21:04:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1896 transitions. [2021-12-17 21:04:33,152 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1896 transitions. Word has length 58 [2021-12-17 21:04:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:33,152 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 1896 transitions. [2021-12-17 21:04:33,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1896 transitions. [2021-12-17 21:04:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 21:04:33,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:33,153 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:33,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 21:04:33,154 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:33,154 INFO L85 PathProgramCache]: Analyzing trace with hash -311304733, now seen corresponding path program 1 times [2021-12-17 21:04:33,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:33,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431722449] [2021-12-17 21:04:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:33,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:33,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:33,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431722449] [2021-12-17 21:04:33,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431722449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:33,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:33,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 21:04:33,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674743623] [2021-12-17 21:04:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:33,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:04:33,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:33,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:04:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 21:04:33,197 INFO L87 Difference]: Start difference. First operand 1404 states and 1896 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 21:04:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:33,510 INFO L93 Difference]: Finished difference Result 3662 states and 4952 transitions. [2021-12-17 21:04:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 21:04:33,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2021-12-17 21:04:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:33,519 INFO L225 Difference]: With dead ends: 3662 [2021-12-17 21:04:33,519 INFO L226 Difference]: Without dead ends: 2365 [2021-12-17 21:04:33,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:04:33,523 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 518 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:33,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 598 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2021-12-17 21:04:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2093. [2021-12-17 21:04:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1685 states have (on average 1.34540059347181) internal successors, (2267), 1718 states have internal predecessors, (2267), 240 states have call successors, (240), 149 states have call predecessors, (240), 166 states have return successors, (273), 230 states have call predecessors, (273), 236 states have call successors, (273) [2021-12-17 21:04:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2780 transitions. [2021-12-17 21:04:33,617 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2780 transitions. Word has length 58 [2021-12-17 21:04:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:33,617 INFO L470 AbstractCegarLoop]: Abstraction has 2093 states and 2780 transitions. [2021-12-17 21:04:33,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 21:04:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2780 transitions. [2021-12-17 21:04:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:33,618 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:33,619 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:33,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 21:04:33,619 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:33,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:33,619 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2021-12-17 21:04:33,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:33,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861348136] [2021-12-17 21:04:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:33,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:33,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:33,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861348136] [2021-12-17 21:04:33,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861348136] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:33,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:33,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:33,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221368230] [2021-12-17 21:04:33,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:33,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:33,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:33,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:33,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:33,672 INFO L87 Difference]: Start difference. First operand 2093 states and 2780 transitions. 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) [2021-12-17 21:04:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:34,097 INFO L93 Difference]: Finished difference Result 2316 states and 3095 transitions. [2021-12-17 21:04:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 21:04:34,098 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 [2021-12-17 21:04:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:34,105 INFO L225 Difference]: With dead ends: 2316 [2021-12-17 21:04:34,106 INFO L226 Difference]: Without dead ends: 2228 [2021-12-17 21:04:34,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:04:34,107 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 674 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:34,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [679 Valid, 866 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2021-12-17 21:04:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2189. [2021-12-17 21:04:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1761 states have (on average 1.346961953435548) internal successors, (2372), 1796 states have internal predecessors, (2372), 251 states have call successors, (251), 156 states have call predecessors, (251), 175 states have return successors, (289), 242 states have call predecessors, (289), 247 states have call successors, (289) [2021-12-17 21:04:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2912 transitions. [2021-12-17 21:04:34,223 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2912 transitions. Word has length 65 [2021-12-17 21:04:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:34,224 INFO L470 AbstractCegarLoop]: Abstraction has 2189 states and 2912 transitions. [2021-12-17 21:04:34,224 INFO L471 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) [2021-12-17 21:04:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2912 transitions. [2021-12-17 21:04:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:34,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:34,225 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:34,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 21:04:34,226 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:34,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2021-12-17 21:04:34,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:34,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848926568] [2021-12-17 21:04:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:34,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:34,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:34,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:34,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:34,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:34,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:34,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:34,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848926568] [2021-12-17 21:04:34,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848926568] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:34,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:34,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:34,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918986979] [2021-12-17 21:04:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:34,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:34,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:34,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:34,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:34,291 INFO L87 Difference]: Start difference. First operand 2189 states and 2912 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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) [2021-12-17 21:04:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:34,907 INFO L93 Difference]: Finished difference Result 2536 states and 3389 transitions. [2021-12-17 21:04:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 21:04:34,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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 [2021-12-17 21:04:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:34,916 INFO L225 Difference]: With dead ends: 2536 [2021-12-17 21:04:34,916 INFO L226 Difference]: Without dead ends: 2359 [2021-12-17 21:04:34,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-17 21:04:34,918 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 548 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:34,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 1319 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2021-12-17 21:04:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2285. [2021-12-17 21:04:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 1837 states have (on average 1.3478497550353838) internal successors, (2476), 1874 states have internal predecessors, (2476), 262 states have call successors, (262), 163 states have call predecessors, (262), 184 states have return successors, (308), 254 states have call predecessors, (308), 258 states have call successors, (308) [2021-12-17 21:04:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3046 transitions. [2021-12-17 21:04:35,007 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3046 transitions. Word has length 65 [2021-12-17 21:04:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:35,008 INFO L470 AbstractCegarLoop]: Abstraction has 2285 states and 3046 transitions. [2021-12-17 21:04:35,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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) [2021-12-17 21:04:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3046 transitions. [2021-12-17 21:04:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:35,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:35,009 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:35,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 21:04:35,010 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:35,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:35,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1002437284, now seen corresponding path program 1 times [2021-12-17 21:04:35,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:35,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569485339] [2021-12-17 21:04:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:35,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:35,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:35,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569485339] [2021-12-17 21:04:35,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569485339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:35,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:35,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:04:35,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139708714] [2021-12-17 21:04:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:35,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:04:35,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:04:35,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:04:35,106 INFO L87 Difference]: Start difference. First operand 2285 states and 3046 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2021-12-17 21:04:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:35,531 INFO L93 Difference]: Finished difference Result 2586 states and 3460 transitions. [2021-12-17 21:04:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:04:35,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2021-12-17 21:04:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:35,540 INFO L225 Difference]: With dead ends: 2586 [2021-12-17 21:04:35,540 INFO L226 Difference]: Without dead ends: 2319 [2021-12-17 21:04:35,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 21:04:35,543 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 212 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:35,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 1415 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2021-12-17 21:04:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2290. [2021-12-17 21:04:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 1841 states have (on average 1.3460076045627376) internal successors, (2478), 1878 states have internal predecessors, (2478), 262 states have call successors, (262), 163 states have call predecessors, (262), 185 states have return successors, (309), 255 states have call predecessors, (309), 258 states have call successors, (309) [2021-12-17 21:04:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3049 transitions. [2021-12-17 21:04:35,625 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3049 transitions. Word has length 65 [2021-12-17 21:04:35,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:35,637 INFO L470 AbstractCegarLoop]: Abstraction has 2290 states and 3049 transitions. [2021-12-17 21:04:35,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2021-12-17 21:04:35,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3049 transitions. [2021-12-17 21:04:35,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:35,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:35,639 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:35,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 21:04:35,640 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2031796582, now seen corresponding path program 1 times [2021-12-17 21:04:35,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:35,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297224986] [2021-12-17 21:04:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:35,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:35,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:35,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297224986] [2021-12-17 21:04:35,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297224986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:35,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:35,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 21:04:35,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240636296] [2021-12-17 21:04:35,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:35,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:04:35,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:04:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:04:35,725 INFO L87 Difference]: Start difference. First operand 2290 states and 3049 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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) [2021-12-17 21:04:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:36,871 INFO L93 Difference]: Finished difference Result 3612 states and 4845 transitions. [2021-12-17 21:04:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 21:04:36,871 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), 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 65 [2021-12-17 21:04:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:36,882 INFO L225 Difference]: With dead ends: 3612 [2021-12-17 21:04:36,882 INFO L226 Difference]: Without dead ends: 3322 [2021-12-17 21:04:36,884 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:36,885 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 1910 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:36,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1924 Valid, 1383 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-17 21:04:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2021-12-17 21:04:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3191. [2021-12-17 21:04:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 2556 states have (on average 1.3368544600938967) internal successors, (3417), 2608 states have internal predecessors, (3417), 350 states have call successors, (350), 246 states have call predecessors, (350), 283 states have return successors, (423), 342 states have call predecessors, (423), 346 states have call successors, (423) [2021-12-17 21:04:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4190 transitions. [2021-12-17 21:04:36,989 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4190 transitions. Word has length 65 [2021-12-17 21:04:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:36,990 INFO L470 AbstractCegarLoop]: Abstraction has 3191 states and 4190 transitions. [2021-12-17 21:04:36,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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) [2021-12-17 21:04:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4190 transitions. [2021-12-17 21:04:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:36,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:36,991 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:36,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 21:04:36,991 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash -980347493, now seen corresponding path program 1 times [2021-12-17 21:04:36,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:36,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824062177] [2021-12-17 21:04:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:36,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:37,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:37,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824062177] [2021-12-17 21:04:37,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824062177] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:37,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:37,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:04:37,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480550114] [2021-12-17 21:04:37,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:37,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:04:37,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:37,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:04:37,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:04:37,100 INFO L87 Difference]: Start difference. First operand 3191 states and 4190 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2021-12-17 21:04:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:37,530 INFO L93 Difference]: Finished difference Result 4482 states and 5863 transitions. [2021-12-17 21:04:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 21:04:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2021-12-17 21:04:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:37,541 INFO L225 Difference]: With dead ends: 4482 [2021-12-17 21:04:37,542 INFO L226 Difference]: Without dead ends: 3297 [2021-12-17 21:04:37,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:04:37,545 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 212 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:37,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 1394 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:37,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2021-12-17 21:04:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3221. [2021-12-17 21:04:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 2580 states have (on average 1.3306201550387597) internal successors, (3433), 2632 states have internal predecessors, (3433), 350 states have call successors, (350), 246 states have call predecessors, (350), 289 states have return successors, (429), 348 states have call predecessors, (429), 346 states have call successors, (429) [2021-12-17 21:04:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4212 transitions. [2021-12-17 21:04:37,681 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4212 transitions. Word has length 65 [2021-12-17 21:04:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:37,682 INFO L470 AbstractCegarLoop]: Abstraction has 3221 states and 4212 transitions. [2021-12-17 21:04:37,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2021-12-17 21:04:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4212 transitions. [2021-12-17 21:04:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:37,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:37,684 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:37,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 21:04:37,684 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash 405855901, now seen corresponding path program 1 times [2021-12-17 21:04:37,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:37,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841987366] [2021-12-17 21:04:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:37,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:37,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:37,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841987366] [2021-12-17 21:04:37,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841987366] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:37,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:37,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:37,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955731298] [2021-12-17 21:04:37,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:37,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:37,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:37,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:37,757 INFO L87 Difference]: Start difference. First operand 3221 states and 4212 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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) [2021-12-17 21:04:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:38,374 INFO L93 Difference]: Finished difference Result 4476 states and 5759 transitions. [2021-12-17 21:04:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 21:04:38,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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 [2021-12-17 21:04:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:38,393 INFO L225 Difference]: With dead ends: 4476 [2021-12-17 21:04:38,393 INFO L226 Difference]: Without dead ends: 3484 [2021-12-17 21:04:38,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-17 21:04:38,398 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 566 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:38,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 1031 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2021-12-17 21:04:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 3163. [2021-12-17 21:04:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3163 states, 2538 states have (on average 1.3286052009456264) internal successors, (3372), 2585 states have internal predecessors, (3372), 344 states have call successors, (344), 241 states have call predecessors, (344), 279 states have return successors, (414), 341 states have call predecessors, (414), 340 states have call successors, (414) [2021-12-17 21:04:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 4130 transitions. [2021-12-17 21:04:38,498 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 4130 transitions. Word has length 65 [2021-12-17 21:04:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:38,498 INFO L470 AbstractCegarLoop]: Abstraction has 3163 states and 4130 transitions. [2021-12-17 21:04:38,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 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) [2021-12-17 21:04:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 4130 transitions. [2021-12-17 21:04:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:38,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:38,500 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:38,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 21:04:38,500 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash 271842395, now seen corresponding path program 1 times [2021-12-17 21:04:38,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:38,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326891719] [2021-12-17 21:04:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:38,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:38,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:38,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326891719] [2021-12-17 21:04:38,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326891719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:38,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:38,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:38,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875635883] [2021-12-17 21:04:38,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:38,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:38,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:38,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:38,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:38,556 INFO L87 Difference]: Start difference. First operand 3163 states and 4130 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:04:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:38,934 INFO L93 Difference]: Finished difference Result 5502 states and 7091 transitions. [2021-12-17 21:04:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 21:04:38,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-17 21:04:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:38,953 INFO L225 Difference]: With dead ends: 5502 [2021-12-17 21:04:38,953 INFO L226 Difference]: Without dead ends: 4346 [2021-12-17 21:04:38,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-17 21:04:38,957 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 672 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:38,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 703 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2021-12-17 21:04:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4226. [2021-12-17 21:04:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 3358 states have (on average 1.2995830851697439) internal successors, (4364), 3422 states have internal predecessors, (4364), 463 states have call successors, (463), 340 states have call predecessors, (463), 403 states have return successors, (605), 469 states have call predecessors, (605), 459 states have call successors, (605) [2021-12-17 21:04:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 5432 transitions. [2021-12-17 21:04:39,113 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 5432 transitions. Word has length 65 [2021-12-17 21:04:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:39,114 INFO L470 AbstractCegarLoop]: Abstraction has 4226 states and 5432 transitions. [2021-12-17 21:04:39,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:04:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5432 transitions. [2021-12-17 21:04:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-17 21:04:39,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:39,115 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:39,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 21:04:39,115 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:39,116 INFO L85 PathProgramCache]: Analyzing trace with hash 520491120, now seen corresponding path program 1 times [2021-12-17 21:04:39,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:39,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668601564] [2021-12-17 21:04:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:39,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:39,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:39,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668601564] [2021-12-17 21:04:39,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668601564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:39,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:39,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:39,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055564408] [2021-12-17 21:04:39,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:39,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:39,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:39,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:39,161 INFO L87 Difference]: Start difference. First operand 4226 states and 5432 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:04:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:39,593 INFO L93 Difference]: Finished difference Result 7542 states and 9577 transitions. [2021-12-17 21:04:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:04:39,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-12-17 21:04:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:39,605 INFO L225 Difference]: With dead ends: 7542 [2021-12-17 21:04:39,606 INFO L226 Difference]: Without dead ends: 5328 [2021-12-17 21:04:39,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:04:39,610 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 388 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:39,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 814 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2021-12-17 21:04:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 5060. [2021-12-17 21:04:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5060 states, 4006 states have (on average 1.2878182725911134) internal successors, (5159), 4075 states have internal predecessors, (5159), 555 states have call successors, (555), 420 states have call predecessors, (555), 497 states have return successors, (719), 570 states have call predecessors, (719), 551 states have call successors, (719) [2021-12-17 21:04:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 6433 transitions. [2021-12-17 21:04:39,789 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 6433 transitions. Word has length 66 [2021-12-17 21:04:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:39,789 INFO L470 AbstractCegarLoop]: Abstraction has 5060 states and 6433 transitions. [2021-12-17 21:04:39,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:04:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 6433 transitions. [2021-12-17 21:04:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-17 21:04:39,791 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:39,791 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:39,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 21:04:39,791 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1207424945, now seen corresponding path program 1 times [2021-12-17 21:04:39,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:39,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166354725] [2021-12-17 21:04:39,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:39,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:39,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166354725] [2021-12-17 21:04:39,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166354725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:39,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:39,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:39,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391273944] [2021-12-17 21:04:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:39,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:39,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:39,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:39,847 INFO L87 Difference]: Start difference. First operand 5060 states and 6433 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:04:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:40,277 INFO L93 Difference]: Finished difference Result 8932 states and 11207 transitions. [2021-12-17 21:04:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:04:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2021-12-17 21:04:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:40,290 INFO L225 Difference]: With dead ends: 8932 [2021-12-17 21:04:40,290 INFO L226 Difference]: Without dead ends: 5882 [2021-12-17 21:04:40,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:04:40,296 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 505 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:40,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 760 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5882 states. [2021-12-17 21:04:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5882 to 5614. [2021-12-17 21:04:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5614 states, 4446 states have (on average 1.2818263607737292) internal successors, (5699), 4519 states have internal predecessors, (5699), 611 states have call successors, (611), 470 states have call predecessors, (611), 555 states have return successors, (792), 630 states have call predecessors, (792), 607 states have call successors, (792) [2021-12-17 21:04:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5614 states to 5614 states and 7102 transitions. [2021-12-17 21:04:40,489 INFO L78 Accepts]: Start accepts. Automaton has 5614 states and 7102 transitions. Word has length 72 [2021-12-17 21:04:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:40,489 INFO L470 AbstractCegarLoop]: Abstraction has 5614 states and 7102 transitions. [2021-12-17 21:04:40,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 21:04:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5614 states and 7102 transitions. [2021-12-17 21:04:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-17 21:04:40,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:40,491 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:40,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 21:04:40,491 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:40,492 INFO L85 PathProgramCache]: Analyzing trace with hash 708381945, now seen corresponding path program 1 times [2021-12-17 21:04:40,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:40,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823806488] [2021-12-17 21:04:40,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:40,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:40,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:40,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823806488] [2021-12-17 21:04:40,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823806488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:40,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:40,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:40,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917475522] [2021-12-17 21:04:40,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:40,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:40,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:40,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:40,551 INFO L87 Difference]: Start difference. First operand 5614 states and 7102 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-17 21:04:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:41,005 INFO L93 Difference]: Finished difference Result 6700 states and 8397 transitions. [2021-12-17 21:04:41,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:04:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2021-12-17 21:04:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:41,019 INFO L225 Difference]: With dead ends: 6700 [2021-12-17 21:04:41,019 INFO L226 Difference]: Without dead ends: 6697 [2021-12-17 21:04:41,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-17 21:04:41,022 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 918 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:41,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 594 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6697 states. [2021-12-17 21:04:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6697 to 6076. [2021-12-17 21:04:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6076 states, 4801 states have (on average 1.2736929806290356) internal successors, (6115), 4877 states have internal predecessors, (6115), 661 states have call successors, (661), 514 states have call predecessors, (661), 612 states have return successors, (869), 690 states have call predecessors, (869), 658 states have call successors, (869) [2021-12-17 21:04:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6076 states to 6076 states and 7645 transitions. [2021-12-17 21:04:41,245 INFO L78 Accepts]: Start accepts. Automaton has 6076 states and 7645 transitions. Word has length 73 [2021-12-17 21:04:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:41,245 INFO L470 AbstractCegarLoop]: Abstraction has 6076 states and 7645 transitions. [2021-12-17 21:04:41,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-17 21:04:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6076 states and 7645 transitions. [2021-12-17 21:04:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-17 21:04:41,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:41,247 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:41,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-17 21:04:41,247 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash 484349401, now seen corresponding path program 1 times [2021-12-17 21:04:41,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:41,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35672762] [2021-12-17 21:04:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:41,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:41,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:41,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35672762] [2021-12-17 21:04:41,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35672762] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:04:41,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323025015] [2021-12-17 21:04:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:41,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:04:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:04:41,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) [2021-12-17 21:04:41,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 21:04:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 21:04:41,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:04:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:41,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 21:04:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:41,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323025015] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 21:04:41,911 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 21:04:41,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-17 21:04:41,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635092727] [2021-12-17 21:04:41,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 21:04:41,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:04:41,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:04:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:04:41,913 INFO L87 Difference]: Start difference. First operand 6076 states and 7645 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-17 21:04:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:43,113 INFO L93 Difference]: Finished difference Result 10394 states and 12854 transitions. [2021-12-17 21:04:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-17 21:04:43,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2021-12-17 21:04:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:43,138 INFO L225 Difference]: With dead ends: 10394 [2021-12-17 21:04:43,138 INFO L226 Difference]: Without dead ends: 10391 [2021-12-17 21:04:43,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2021-12-17 21:04:43,144 INFO L933 BasicCegarLoop]: 446 mSDtfsCounter, 1342 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:43,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1395 Valid, 1399 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:04:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10391 states. [2021-12-17 21:04:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10391 to 9493. [2021-12-17 21:04:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9493 states, 7476 states have (on average 1.2570893525949707) internal successors, (9398), 7587 states have internal predecessors, (9398), 1020 states have call successors, (1020), 828 states have call predecessors, (1020), 995 states have return successors, (1370), 1083 states have call predecessors, (1370), 1017 states have call successors, (1370) [2021-12-17 21:04:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9493 states to 9493 states and 11788 transitions. [2021-12-17 21:04:43,557 INFO L78 Accepts]: Start accepts. Automaton has 9493 states and 11788 transitions. Word has length 74 [2021-12-17 21:04:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:43,558 INFO L470 AbstractCegarLoop]: Abstraction has 9493 states and 11788 transitions. [2021-12-17 21:04:43,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-17 21:04:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 9493 states and 11788 transitions. [2021-12-17 21:04:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-17 21:04:43,560 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:43,560 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:43,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 21:04:43,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:04:43,777 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1609727865, now seen corresponding path program 2 times [2021-12-17 21:04:43,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:43,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719760035] [2021-12-17 21:04:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:43,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:43,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:43,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719760035] [2021-12-17 21:04:43,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719760035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:43,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:43,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:43,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724464989] [2021-12-17 21:04:43,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:43,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:43,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:43,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:43,828 INFO L87 Difference]: Start difference. First operand 9493 states and 11788 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-17 21:04:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:44,263 INFO L93 Difference]: Finished difference Result 12087 states and 14997 transitions. [2021-12-17 21:04:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 21:04:44,264 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), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2021-12-17 21:04:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:44,276 INFO L225 Difference]: With dead ends: 12087 [2021-12-17 21:04:44,276 INFO L226 Difference]: Without dead ends: 5913 [2021-12-17 21:04:44,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:04:44,285 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 540 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:44,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 676 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2021-12-17 21:04:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 4905. [2021-12-17 21:04:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4905 states, 3894 states have (on average 1.270929635336415) internal successors, (4949), 3951 states have internal predecessors, (4949), 539 states have call successors, (539), 410 states have call predecessors, (539), 470 states have return successors, (669), 549 states have call predecessors, (669), 536 states have call successors, (669) [2021-12-17 21:04:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4905 states to 4905 states and 6157 transitions. [2021-12-17 21:04:44,467 INFO L78 Accepts]: Start accepts. Automaton has 4905 states and 6157 transitions. Word has length 77 [2021-12-17 21:04:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:44,467 INFO L470 AbstractCegarLoop]: Abstraction has 4905 states and 6157 transitions. [2021-12-17 21:04:44,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-17 21:04:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4905 states and 6157 transitions. [2021-12-17 21:04:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-17 21:04:44,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:44,470 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:04:44,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-17 21:04:44,470 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:44,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:44,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1048076277, now seen corresponding path program 1 times [2021-12-17 21:04:44,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:44,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775397022] [2021-12-17 21:04:44,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:44,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 21:04:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 21:04:44,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:44,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775397022] [2021-12-17 21:04:44,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775397022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:44,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:44,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:44,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727625135] [2021-12-17 21:04:44,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:44,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:44,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:44,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:44,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:44,524 INFO L87 Difference]: Start difference. First operand 4905 states and 6157 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 21:04:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:45,284 INFO L93 Difference]: Finished difference Result 10689 states and 13154 transitions. [2021-12-17 21:04:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 21:04:45,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2021-12-17 21:04:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:45,304 INFO L225 Difference]: With dead ends: 10689 [2021-12-17 21:04:45,304 INFO L226 Difference]: Without dead ends: 6991 [2021-12-17 21:04:45,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-17 21:04:45,314 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 843 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:45,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [855 Valid, 924 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2021-12-17 21:04:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 6731. [2021-12-17 21:04:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6731 states, 5285 states have (on average 1.2410596026490066) internal successors, (6559), 5379 states have internal predecessors, (6559), 739 states have call successors, (739), 582 states have call predecessors, (739), 705 states have return successors, (1019), 775 states have call predecessors, (1019), 736 states have call successors, (1019) [2021-12-17 21:04:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 8317 transitions. [2021-12-17 21:04:45,631 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 8317 transitions. Word has length 84 [2021-12-17 21:04:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:45,631 INFO L470 AbstractCegarLoop]: Abstraction has 6731 states and 8317 transitions. [2021-12-17 21:04:45,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 21:04:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 8317 transitions. [2021-12-17 21:04:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-17 21:04:45,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:45,635 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:45,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-17 21:04:45,635 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash 191116075, now seen corresponding path program 1 times [2021-12-17 21:04:45,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:45,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420789510] [2021-12-17 21:04:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:45,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 21:04:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 21:04:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-17 21:04:45,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:45,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420789510] [2021-12-17 21:04:45,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420789510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:45,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:45,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:45,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912371494] [2021-12-17 21:04:45,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:45,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:45,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:45,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:45,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:45,715 INFO L87 Difference]: Start difference. First operand 6731 states and 8317 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:04:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:46,393 INFO L93 Difference]: Finished difference Result 11083 states and 14212 transitions. [2021-12-17 21:04:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:04:46,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2021-12-17 21:04:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:46,422 INFO L225 Difference]: With dead ends: 11083 [2021-12-17 21:04:46,422 INFO L226 Difference]: Without dead ends: 9099 [2021-12-17 21:04:46,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-17 21:04:46,432 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 808 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:46,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 624 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2021-12-17 21:04:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 8621. [2021-12-17 21:04:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8621 states, 6781 states have (on average 1.2545347293909452) internal successors, (8507), 6918 states have internal predecessors, (8507), 952 states have call successors, (952), 720 states have call predecessors, (952), 886 states have return successors, (1385), 992 states have call predecessors, (1385), 949 states have call successors, (1385) [2021-12-17 21:04:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8621 states to 8621 states and 10844 transitions. [2021-12-17 21:04:46,837 INFO L78 Accepts]: Start accepts. Automaton has 8621 states and 10844 transitions. Word has length 93 [2021-12-17 21:04:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:46,837 INFO L470 AbstractCegarLoop]: Abstraction has 8621 states and 10844 transitions. [2021-12-17 21:04:46,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:04:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 8621 states and 10844 transitions. [2021-12-17 21:04:46,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-17 21:04:46,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:46,842 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:46,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-17 21:04:46,842 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1688014871, now seen corresponding path program 1 times [2021-12-17 21:04:46,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:46,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557252442] [2021-12-17 21:04:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:46,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 21:04:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 21:04:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-17 21:04:46,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:46,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557252442] [2021-12-17 21:04:46,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557252442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:46,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:46,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 21:04:46,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183588116] [2021-12-17 21:04:46,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:46,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:04:46,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:46,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:04:46,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 21:04:46,885 INFO L87 Difference]: Start difference. First operand 8621 states and 10844 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:04:47,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:47,325 INFO L93 Difference]: Finished difference Result 12127 states and 15485 transitions. [2021-12-17 21:04:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:04:47,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (8), 4 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 93 [2021-12-17 21:04:47,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:47,344 INFO L225 Difference]: With dead ends: 12127 [2021-12-17 21:04:47,345 INFO L226 Difference]: Without dead ends: 8253 [2021-12-17 21:04:47,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:04:47,356 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 360 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:47,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 564 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2021-12-17 21:04:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 7865. [2021-12-17 21:04:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7865 states, 6183 states have (on average 1.24745269286754) internal successors, (7713), 6308 states have internal predecessors, (7713), 859 states have call successors, (859), 662 states have call predecessors, (859), 821 states have return successors, (1247), 900 states have call predecessors, (1247), 856 states have call successors, (1247) [2021-12-17 21:04:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7865 states to 7865 states and 9819 transitions. [2021-12-17 21:04:47,696 INFO L78 Accepts]: Start accepts. Automaton has 7865 states and 9819 transitions. Word has length 93 [2021-12-17 21:04:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:47,697 INFO L470 AbstractCegarLoop]: Abstraction has 7865 states and 9819 transitions. [2021-12-17 21:04:47,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:04:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7865 states and 9819 transitions. [2021-12-17 21:04:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-17 21:04:47,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:47,700 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-17 21:04:47,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-17 21:04:47,701 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:47,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:47,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2008597495, now seen corresponding path program 1 times [2021-12-17 21:04:47,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:47,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775496566] [2021-12-17 21:04:47,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:47,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:04:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 21:04:47,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:47,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775496566] [2021-12-17 21:04:47,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775496566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:47,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:47,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:04:47,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113599194] [2021-12-17 21:04:47,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:47,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:04:47,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:04:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:04:47,756 INFO L87 Difference]: Start difference. First operand 7865 states and 9819 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) [2021-12-17 21:04:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:48,598 INFO L93 Difference]: Finished difference Result 11225 states and 13837 transitions. [2021-12-17 21:04:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 21:04:48,599 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 93 [2021-12-17 21:04:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:48,612 INFO L225 Difference]: With dead ends: 11225 [2021-12-17 21:04:48,612 INFO L226 Difference]: Without dead ends: 7026 [2021-12-17 21:04:48,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-17 21:04:48,621 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1269 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:48,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1297 Valid, 939 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:04:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2021-12-17 21:04:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 6605. [2021-12-17 21:04:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6605 states, 5189 states have (on average 1.2462902293312776) internal successors, (6467), 5302 states have internal predecessors, (6467), 724 states have call successors, (724), 544 states have call predecessors, (724), 690 states have return successors, (1016), 764 states have call predecessors, (1016), 721 states have call successors, (1016) [2021-12-17 21:04:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6605 states to 6605 states and 8207 transitions. [2021-12-17 21:04:48,906 INFO L78 Accepts]: Start accepts. Automaton has 6605 states and 8207 transitions. Word has length 93 [2021-12-17 21:04:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:48,906 INFO L470 AbstractCegarLoop]: Abstraction has 6605 states and 8207 transitions. [2021-12-17 21:04:48,907 INFO L471 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) [2021-12-17 21:04:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6605 states and 8207 transitions. [2021-12-17 21:04:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-17 21:04:48,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:48,910 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:48,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-17 21:04:48,910 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2044665117, now seen corresponding path program 1 times [2021-12-17 21:04:48,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:48,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802282774] [2021-12-17 21:04:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:48,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 21:04:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 21:04:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:04:48,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:48,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802282774] [2021-12-17 21:04:48,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802282774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:48,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:48,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:48,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362955943] [2021-12-17 21:04:48,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:48,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:48,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:48,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:48,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:48,962 INFO L87 Difference]: Start difference. First operand 6605 states and 8207 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:04:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:50,055 INFO L93 Difference]: Finished difference Result 13084 states and 16964 transitions. [2021-12-17 21:04:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 21:04:50,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 94 [2021-12-17 21:04:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:50,071 INFO L225 Difference]: With dead ends: 13084 [2021-12-17 21:04:50,071 INFO L226 Difference]: Without dead ends: 8402 [2021-12-17 21:04:50,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-12-17 21:04:50,081 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 1305 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:50,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1319 Valid, 908 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:04:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8402 states. [2021-12-17 21:04:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8402 to 8038. [2021-12-17 21:04:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8038 states, 6384 states have (on average 1.2352756892230576) internal successors, (7886), 6529 states have internal predecessors, (7886), 834 states have call successors, (834), 634 states have call predecessors, (834), 818 states have return successors, (1184), 880 states have call predecessors, (1184), 831 states have call successors, (1184) [2021-12-17 21:04:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8038 states to 8038 states and 9904 transitions. [2021-12-17 21:04:50,518 INFO L78 Accepts]: Start accepts. Automaton has 8038 states and 9904 transitions. Word has length 94 [2021-12-17 21:04:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:50,519 INFO L470 AbstractCegarLoop]: Abstraction has 8038 states and 9904 transitions. [2021-12-17 21:04:50,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:04:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 8038 states and 9904 transitions. [2021-12-17 21:04:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-17 21:04:50,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:50,527 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:50,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-17 21:04:50,527 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:50,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1681738094, now seen corresponding path program 1 times [2021-12-17 21:04:50,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:50,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110033841] [2021-12-17 21:04:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:50,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 21:04:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:04:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:04:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 21:04:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-17 21:04:50,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110033841] [2021-12-17 21:04:50,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110033841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:50,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:50,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:50,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523151249] [2021-12-17 21:04:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:50,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:50,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:50,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:50,604 INFO L87 Difference]: Start difference. First operand 8038 states and 9904 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 21:04:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:51,605 INFO L93 Difference]: Finished difference Result 14341 states and 18403 transitions. [2021-12-17 21:04:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 21:04:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 136 [2021-12-17 21:04:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:51,627 INFO L225 Difference]: With dead ends: 14341 [2021-12-17 21:04:51,627 INFO L226 Difference]: Without dead ends: 9916 [2021-12-17 21:04:51,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2021-12-17 21:04:51,640 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 1313 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:51,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1327 Valid, 695 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2021-12-17 21:04:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 9288. [2021-12-17 21:04:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9288 states, 7436 states have (on average 1.212614308768155) internal successors, (9017), 7608 states have internal predecessors, (9017), 921 states have call successors, (921), 721 states have call predecessors, (921), 929 states have return successors, (1330), 964 states have call predecessors, (1330), 918 states have call successors, (1330) [2021-12-17 21:04:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 11268 transitions. [2021-12-17 21:04:52,141 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 11268 transitions. Word has length 136 [2021-12-17 21:04:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:52,141 INFO L470 AbstractCegarLoop]: Abstraction has 9288 states and 11268 transitions. [2021-12-17 21:04:52,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 21:04:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 11268 transitions. [2021-12-17 21:04:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-17 21:04:52,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:52,149 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:52,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-17 21:04:52,149 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1782103125, now seen corresponding path program 2 times [2021-12-17 21:04:52,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:52,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180582177] [2021-12-17 21:04:52,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:52,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 21:04:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:04:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:04:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 21:04:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-17 21:04:52,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:52,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180582177] [2021-12-17 21:04:52,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180582177] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:04:52,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854286586] [2021-12-17 21:04:52,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 21:04:52,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:04:52,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:04:52,208 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) [2021-12-17 21:04:52,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 21:04:52,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 21:04:52,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 21:04:52,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:04:52,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:04:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 21:04:52,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:04:52,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854286586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:52,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:04:52,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-17 21:04:52,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505561364] [2021-12-17 21:04:52,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:52,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:04:52,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:52,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:04:52,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:52,471 INFO L87 Difference]: Start difference. First operand 9288 states and 11268 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:04:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:52,780 INFO L93 Difference]: Finished difference Result 13402 states and 16609 transitions. [2021-12-17 21:04:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:04:52,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2021-12-17 21:04:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:52,800 INFO L225 Difference]: With dead ends: 13402 [2021-12-17 21:04:52,800 INFO L226 Difference]: Without dead ends: 9104 [2021-12-17 21:04:52,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:52,810 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 90 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:52,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 643 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:04:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9104 states. [2021-12-17 21:04:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9104 to 9072. [2021-12-17 21:04:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9072 states, 7220 states have (on average 1.202770083102493) internal successors, (8684), 7392 states have internal predecessors, (8684), 921 states have call successors, (921), 721 states have call predecessors, (921), 929 states have return successors, (1330), 964 states have call predecessors, (1330), 918 states have call successors, (1330) [2021-12-17 21:04:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9072 states to 9072 states and 10935 transitions. [2021-12-17 21:04:53,228 INFO L78 Accepts]: Start accepts. Automaton has 9072 states and 10935 transitions. Word has length 136 [2021-12-17 21:04:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:53,228 INFO L470 AbstractCegarLoop]: Abstraction has 9072 states and 10935 transitions. [2021-12-17 21:04:53,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:04:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 9072 states and 10935 transitions. [2021-12-17 21:04:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-17 21:04:53,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:53,235 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:53,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 21:04:53,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-17 21:04:53,451 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:53,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1021717307, now seen corresponding path program 1 times [2021-12-17 21:04:53,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:53,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753505011] [2021-12-17 21:04:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:53,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 21:04:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:04:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:04:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:04:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-17 21:04:53,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:53,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753505011] [2021-12-17 21:04:53,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753505011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:53,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:53,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:53,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351180656] [2021-12-17 21:04:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:53,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:53,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:53,528 INFO L87 Difference]: Start difference. First operand 9072 states and 10935 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 21:04:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:54,429 INFO L93 Difference]: Finished difference Result 17716 states and 21681 transitions. [2021-12-17 21:04:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 21:04:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2021-12-17 21:04:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:54,464 INFO L225 Difference]: With dead ends: 17716 [2021-12-17 21:04:54,464 INFO L226 Difference]: Without dead ends: 14094 [2021-12-17 21:04:54,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-17 21:04:54,476 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 769 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:54,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [804 Valid, 870 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14094 states. [2021-12-17 21:04:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14094 to 12153. [2021-12-17 21:04:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12153 states, 9746 states have (on average 1.2138313154114508) internal successors, (11830), 9994 states have internal predecessors, (11830), 1195 states have call successors, (1195), 923 states have call predecessors, (1195), 1210 states have return successors, (1774), 1241 states have call predecessors, (1774), 1192 states have call successors, (1774) [2021-12-17 21:04:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12153 states to 12153 states and 14799 transitions. [2021-12-17 21:04:55,141 INFO L78 Accepts]: Start accepts. Automaton has 12153 states and 14799 transitions. Word has length 137 [2021-12-17 21:04:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:55,141 INFO L470 AbstractCegarLoop]: Abstraction has 12153 states and 14799 transitions. [2021-12-17 21:04:55,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 21:04:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 12153 states and 14799 transitions. [2021-12-17 21:04:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-17 21:04:55,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:55,149 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-17 21:04:55,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-17 21:04:55,149 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1303301901, now seen corresponding path program 1 times [2021-12-17 21:04:55,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:55,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899835109] [2021-12-17 21:04:55,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:55,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 21:04:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:04:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 21:04:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-17 21:04:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 21:04:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 21:04:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-17 21:04:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-17 21:04:55,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:55,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899835109] [2021-12-17 21:04:55,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899835109] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:04:55,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364853140] [2021-12-17 21:04:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:55,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:04:55,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:04:55,223 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) [2021-12-17 21:04:55,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 21:04:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 21:04:55,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:04:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 21:04:55,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:04:55,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364853140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:55,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:04:55,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-17 21:04:55,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147657240] [2021-12-17 21:04:55,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:55,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:55,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:55,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-17 21:04:55,487 INFO L87 Difference]: Start difference. First operand 12153 states and 14799 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-17 21:04:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:55,888 INFO L93 Difference]: Finished difference Result 14028 states and 17038 transitions. [2021-12-17 21:04:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:04:55,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2021-12-17 21:04:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:55,913 INFO L225 Difference]: With dead ends: 14028 [2021-12-17 21:04:55,914 INFO L226 Difference]: Without dead ends: 10569 [2021-12-17 21:04:55,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-17 21:04:55,923 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 34 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:55,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1373 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:04:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10569 states. [2021-12-17 21:04:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10569 to 10447. [2021-12-17 21:04:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10447 states, 8486 states have (on average 1.2184774923403252) internal successors, (10340), 8697 states have internal predecessors, (10340), 984 states have call successors, (984), 737 states have call predecessors, (984), 975 states have return successors, (1481), 1016 states have call predecessors, (1481), 981 states have call successors, (1481) [2021-12-17 21:04:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10447 states to 10447 states and 12805 transitions. [2021-12-17 21:04:56,487 INFO L78 Accepts]: Start accepts. Automaton has 10447 states and 12805 transitions. Word has length 145 [2021-12-17 21:04:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:56,487 INFO L470 AbstractCegarLoop]: Abstraction has 10447 states and 12805 transitions. [2021-12-17 21:04:56,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-17 21:04:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 10447 states and 12805 transitions. [2021-12-17 21:04:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-17 21:04:56,495 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:56,495 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:56,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 21:04:56,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:04:56,696 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash -72735443, now seen corresponding path program 1 times [2021-12-17 21:04:56,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:56,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355233662] [2021-12-17 21:04:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:56,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:04:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:04:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:04:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:04:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 21:04:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:04:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:04:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:04:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 21:04:56,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:56,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355233662] [2021-12-17 21:04:56,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355233662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:56,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:56,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 21:04:56,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807746383] [2021-12-17 21:04:56,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:56,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:04:56,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:56,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:04:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 21:04:56,757 INFO L87 Difference]: Start difference. First operand 10447 states and 12805 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:04:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:57,567 INFO L93 Difference]: Finished difference Result 16958 states and 21605 transitions. [2021-12-17 21:04:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 21:04:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2021-12-17 21:04:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:57,602 INFO L225 Difference]: With dead ends: 16958 [2021-12-17 21:04:57,602 INFO L226 Difference]: Without dead ends: 12609 [2021-12-17 21:04:57,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:57,615 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 255 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:57,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 809 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12609 states. [2021-12-17 21:04:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12609 to 10453. [2021-12-17 21:04:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10453 states, 8492 states have (on average 1.2183231276495525) internal successors, (10346), 8703 states have internal predecessors, (10346), 984 states have call successors, (984), 737 states have call predecessors, (984), 975 states have return successors, (1481), 1016 states have call predecessors, (1481), 981 states have call successors, (1481) [2021-12-17 21:04:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10453 states to 10453 states and 12811 transitions. [2021-12-17 21:04:58,243 INFO L78 Accepts]: Start accepts. Automaton has 10453 states and 12811 transitions. Word has length 141 [2021-12-17 21:04:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:58,244 INFO L470 AbstractCegarLoop]: Abstraction has 10453 states and 12811 transitions. [2021-12-17 21:04:58,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:04:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 10453 states and 12811 transitions. [2021-12-17 21:04:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-17 21:04:58,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:58,252 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:58,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-17 21:04:58,252 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:58,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1025674187, now seen corresponding path program 1 times [2021-12-17 21:04:58,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:58,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962989246] [2021-12-17 21:04:58,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:58,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 21:04:58,262 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 21:04:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 21:04:58,303 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 21:04:58,303 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 21:04:58,304 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-17 21:04:58,305 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-17 21:04:58,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-17 21:04:58,307 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2021-12-17 21:04:58,310 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 21:04:58,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 09:04:58 BoogieIcfgContainer [2021-12-17 21:04:58,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 21:04:58,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 21:04:58,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 21:04:58,386 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 21:04:58,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:04:27" (3/4) ... [2021-12-17 21:04:58,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 21:04:58,455 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 21:04:58,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 21:04:58,456 INFO L158 Benchmark]: Toolchain (without parser) took 31805.32ms. Allocated memory was 102.8MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 71.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-17 21:04:58,456 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 21:04:58,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.84ms. Allocated memory is still 102.8MB. Free memory was 71.7MB in the beginning and 73.3MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 21:04:58,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.33ms. Allocated memory is still 102.8MB. Free memory was 73.3MB in the beginning and 70.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 21:04:58,457 INFO L158 Benchmark]: Boogie Preprocessor took 36.90ms. Allocated memory is still 102.8MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 21:04:58,457 INFO L158 Benchmark]: RCFGBuilder took 500.14ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 68.4MB in the beginning and 101.1MB in the end (delta: -32.7MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2021-12-17 21:04:58,457 INFO L158 Benchmark]: TraceAbstraction took 30800.99ms. Allocated memory was 130.0MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 100.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-17 21:04:58,457 INFO L158 Benchmark]: Witness Printer took 69.58ms. Allocated memory is still 3.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-17 21:04:58,458 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.84ms. Allocated memory is still 102.8MB. Free memory was 71.7MB in the beginning and 73.3MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.33ms. Allocated memory is still 102.8MB. Free memory was 73.3MB in the beginning and 70.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.90ms. Allocated memory is still 102.8MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.14ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 68.4MB in the beginning and 101.1MB in the end (delta: -32.7MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 30800.99ms. Allocated memory was 130.0MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 100.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 69.58ms. Allocated memory is still 3.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 216 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 32, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20502 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20004 mSDsluCounter, 29326 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19702 mSDsCounter, 5342 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16354 IncrementalHoareTripleChecker+Invalid, 21696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5342 mSolverCounterUnsat, 9624 mSDtfsCounter, 16354 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1495 GetRequests, 1044 SyntacticMatches, 6 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12153occurred in iteration=29, InterpolantAutomatonStates: 423, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 12351 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2988 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2885 ConstructedInterpolants, 0 QuantifiedInterpolants, 6318 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1214 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 35 InterpolantComputations, 30 PerfectInterpolantSequences, 677/696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-17 21:04:58,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE