./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.03.cil.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/systemc/transmitter.03.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 01:08:44,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 01:08:44,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 01:08:44,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 01:08:44,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 01:08:44,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 01:08:44,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 01:08:44,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 01:08:44,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 01:08:44,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 01:08:44,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 01:08:44,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 01:08:44,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 01:08:44,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 01:08:44,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 01:08:44,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 01:08:44,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 01:08:44,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 01:08:44,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 01:08:44,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 01:08:44,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 01:08:44,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 01:08:44,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 01:08:44,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 01:08:44,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 01:08:44,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 01:08:44,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 01:08:44,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 01:08:44,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 01:08:44,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 01:08:44,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 01:08:44,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 01:08:44,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 01:08:44,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 01:08:44,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 01:08:44,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 01:08:44,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 01:08:44,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 01:08:44,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 01:08:44,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 01:08:44,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 01:08:44,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 01:08:44,523 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 01:08:44,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 01:08:44,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 01:08:44,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 01:08:44,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 01:08:44,525 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 01:08:44,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 01:08:44,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 01:08:44,526 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 01:08:44,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 01:08:44,527 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 01:08:44,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 01:08:44,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 01:08:44,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 01:08:44,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 01:08:44,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 01:08:44,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 01:08:44,528 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 01:08:44,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 01:08:44,528 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 01:08:44,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 01:08:44,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 01:08:44,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 01:08:44,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 01:08:44,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:08:44,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 01:08:44,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 01:08:44,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 01:08:44,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 01:08:44,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 01:08:44,530 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 01:08:44,530 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 01:08:44,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 01:08:44,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 01:08:44,530 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 -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2021-12-16 01:08:44,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 01:08:44,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 01:08:44,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 01:08:44,741 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 01:08:44,742 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 01:08:44,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.03.cil.c [2021-12-16 01:08:44,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f229aa50d/2bca8d31c4c842dc8a54e8ec4f91b01e/FLAG1a1b1ad84 [2021-12-16 01:08:45,156 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 01:08:45,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c [2021-12-16 01:08:45,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f229aa50d/2bca8d31c4c842dc8a54e8ec4f91b01e/FLAG1a1b1ad84 [2021-12-16 01:08:45,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f229aa50d/2bca8d31c4c842dc8a54e8ec4f91b01e [2021-12-16 01:08:45,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 01:08:45,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 01:08:45,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 01:08:45,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 01:08:45,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 01:08:45,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f5710f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45, skipping insertion in model container [2021-12-16 01:08:45,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 01:08:45,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 01:08:45,366 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/systemc/transmitter.03.cil.c[706,719] [2021-12-16 01:08:45,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:08:45,442 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 01:08:45,451 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/systemc/transmitter.03.cil.c[706,719] [2021-12-16 01:08:45,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:08:45,498 INFO L208 MainTranslator]: Completed translation [2021-12-16 01:08:45,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45 WrapperNode [2021-12-16 01:08:45,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 01:08:45,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 01:08:45,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 01:08:45,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 01:08:45,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,554 INFO L137 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 321 [2021-12-16 01:08:45,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 01:08:45,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 01:08:45,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 01:08:45,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 01:08:45,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 01:08:45,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 01:08:45,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 01:08:45,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 01:08:45,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (1/1) ... [2021-12-16 01:08:45,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:08:45,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:45,618 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-16 01:08:45,619 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-16 01:08:45,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 01:08:45,647 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-16 01:08:45,647 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-16 01:08:45,647 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-16 01:08:45,648 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-16 01:08:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-16 01:08:45,648 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-16 01:08:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-16 01:08:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-16 01:08:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-16 01:08:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-16 01:08:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 01:08:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-16 01:08:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-16 01:08:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 01:08:45,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 01:08:45,754 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 01:08:45,755 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 01:08:46,045 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 01:08:46,050 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 01:08:46,051 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-16 01:08:46,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:08:46 BoogieIcfgContainer [2021-12-16 01:08:46,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 01:08:46,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 01:08:46,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 01:08:46,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 01:08:46,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:08:45" (1/3) ... [2021-12-16 01:08:46,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ace07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:08:46, skipping insertion in model container [2021-12-16 01:08:46,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:45" (2/3) ... [2021-12-16 01:08:46,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ace07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:08:46, skipping insertion in model container [2021-12-16 01:08:46,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:08:46" (3/3) ... [2021-12-16 01:08:46,058 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2021-12-16 01:08:46,062 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 01:08:46,062 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 01:08:46,104 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 01:08:46,110 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-16 01:08:46,110 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 01:08:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 131 states have internal predecessors, (205), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-16 01:08:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:46,133 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:46,133 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:46,134 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash 377890557, now seen corresponding path program 1 times [2021-12-16 01:08:46,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:46,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568209554] [2021-12-16 01:08:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:46,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,431 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-16 01:08:46,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:46,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568209554] [2021-12-16 01:08:46,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568209554] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:46,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:46,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:08:46,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993871209] [2021-12-16 01:08:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:46,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:08:46,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:08:46,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:46,458 INFO L87 Difference]: Start difference. First operand has 153 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 131 states have internal predecessors, (205), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:47,024 INFO L93 Difference]: Finished difference Result 334 states and 525 transitions. [2021-12-16 01:08:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:08:47,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:47,034 INFO L225 Difference]: With dead ends: 334 [2021-12-16 01:08:47,034 INFO L226 Difference]: Without dead ends: 188 [2021-12-16 01:08:47,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-16 01:08:47,039 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 339 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:47,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 479 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 01:08:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-16 01:08:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 148. [2021-12-16 01:08:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 125 states have (on average 1.472) internal successors, (184), 126 states have internal predecessors, (184), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-16 01:08:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2021-12-16 01:08:47,077 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 79 [2021-12-16 01:08:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:47,077 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2021-12-16 01:08:47,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2021-12-16 01:08:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:47,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:47,080 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:47,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 01:08:47,080 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash -354076869, now seen corresponding path program 1 times [2021-12-16 01:08:47,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:47,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967191451] [2021-12-16 01:08:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:47,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,173 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-16 01:08:47,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:47,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967191451] [2021-12-16 01:08:47,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967191451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:47,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:47,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:47,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582688288] [2021-12-16 01:08:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:47,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:47,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:47,175 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:47,560 INFO L93 Difference]: Finished difference Result 325 states and 486 transitions. [2021-12-16 01:08:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:08:47,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:47,566 INFO L225 Difference]: With dead ends: 325 [2021-12-16 01:08:47,566 INFO L226 Difference]: Without dead ends: 188 [2021-12-16 01:08:47,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-16 01:08:47,574 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 413 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:47,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 470 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-16 01:08:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 148. [2021-12-16 01:08:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 125 states have (on average 1.448) internal successors, (181), 126 states have internal predecessors, (181), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-16 01:08:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 213 transitions. [2021-12-16 01:08:47,590 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 213 transitions. Word has length 79 [2021-12-16 01:08:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:47,590 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 213 transitions. [2021-12-16 01:08:47,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2021-12-16 01:08:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:47,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:47,592 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:47,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 01:08:47,592 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1514758267, now seen corresponding path program 1 times [2021-12-16 01:08:47,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:47,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181588404] [2021-12-16 01:08:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:47,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,690 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-16 01:08:47,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:47,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181588404] [2021-12-16 01:08:47,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181588404] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:47,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:47,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:08:47,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776282538] [2021-12-16 01:08:47,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:47,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:08:47,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:47,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:08:47,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:08:47,692 INFO L87 Difference]: Start difference. First operand 148 states and 213 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:48,393 INFO L93 Difference]: Finished difference Result 510 states and 748 transitions. [2021-12-16 01:08:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 01:08:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:48,396 INFO L225 Difference]: With dead ends: 510 [2021-12-16 01:08:48,396 INFO L226 Difference]: Without dead ends: 373 [2021-12-16 01:08:48,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-12-16 01:08:48,397 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 620 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:48,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 1150 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 01:08:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-12-16 01:08:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 285. [2021-12-16 01:08:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 243 states have (on average 1.4526748971193415) internal successors, (353), 245 states have internal predecessors, (353), 28 states have call successors, (28), 12 states have call predecessors, (28), 13 states have return successors, (31), 29 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-16 01:08:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 412 transitions. [2021-12-16 01:08:48,418 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 412 transitions. Word has length 79 [2021-12-16 01:08:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:48,419 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 412 transitions. [2021-12-16 01:08:48,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 412 transitions. [2021-12-16 01:08:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:48,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:48,420 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:48,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 01:08:48,421 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1097361661, now seen corresponding path program 1 times [2021-12-16 01:08:48,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:48,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285106772] [2021-12-16 01:08:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:48,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,519 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-16 01:08:48,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:48,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285106772] [2021-12-16 01:08:48,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285106772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:48,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:48,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:48,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935089748] [2021-12-16 01:08:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:48,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:48,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:48,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:48,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:48,524 INFO L87 Difference]: Start difference. First operand 285 states and 412 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:48,834 INFO L93 Difference]: Finished difference Result 651 states and 957 transitions. [2021-12-16 01:08:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:08:48,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:48,836 INFO L225 Difference]: With dead ends: 651 [2021-12-16 01:08:48,836 INFO L226 Difference]: Without dead ends: 377 [2021-12-16 01:08:48,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:08:48,838 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 406 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:48,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 468 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-12-16 01:08:48,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 285. [2021-12-16 01:08:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 243 states have (on average 1.4444444444444444) internal successors, (351), 245 states have internal predecessors, (351), 28 states have call successors, (28), 12 states have call predecessors, (28), 13 states have return successors, (31), 29 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-16 01:08:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 410 transitions. [2021-12-16 01:08:48,860 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 410 transitions. Word has length 79 [2021-12-16 01:08:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:48,861 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 410 transitions. [2021-12-16 01:08:48,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 410 transitions. [2021-12-16 01:08:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:48,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:48,867 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:48,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 01:08:48,867 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1776633915, now seen corresponding path program 1 times [2021-12-16 01:08:48,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:48,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464923168] [2021-12-16 01:08:48,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:48,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,941 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-16 01:08:48,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:48,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464923168] [2021-12-16 01:08:48,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464923168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:48,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:48,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:48,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332985837] [2021-12-16 01:08:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:48,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:48,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:48,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:48,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:48,942 INFO L87 Difference]: Start difference. First operand 285 states and 410 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:49,262 INFO L93 Difference]: Finished difference Result 648 states and 945 transitions. [2021-12-16 01:08:49,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:08:49,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:49,266 INFO L225 Difference]: With dead ends: 648 [2021-12-16 01:08:49,266 INFO L226 Difference]: Without dead ends: 374 [2021-12-16 01:08:49,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:08:49,269 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 404 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:49,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 464 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-12-16 01:08:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 285. [2021-12-16 01:08:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 243 states have (on average 1.4362139917695473) internal successors, (349), 245 states have internal predecessors, (349), 28 states have call successors, (28), 12 states have call predecessors, (28), 13 states have return successors, (31), 29 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-16 01:08:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 408 transitions. [2021-12-16 01:08:49,293 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 408 transitions. Word has length 79 [2021-12-16 01:08:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:49,293 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 408 transitions. [2021-12-16 01:08:49,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 408 transitions. [2021-12-16 01:08:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:49,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:49,295 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:49,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 01:08:49,295 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:49,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash -556758723, now seen corresponding path program 1 times [2021-12-16 01:08:49,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:49,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516499596] [2021-12-16 01:08:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:49,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,372 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-16 01:08:49,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:49,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516499596] [2021-12-16 01:08:49,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516499596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:49,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:49,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:49,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799666142] [2021-12-16 01:08:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:49,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:49,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:49,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:49,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:49,374 INFO L87 Difference]: Start difference. First operand 285 states and 408 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:49,668 INFO L93 Difference]: Finished difference Result 645 states and 933 transitions. [2021-12-16 01:08:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:08:49,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:49,670 INFO L225 Difference]: With dead ends: 645 [2021-12-16 01:08:49,670 INFO L226 Difference]: Without dead ends: 371 [2021-12-16 01:08:49,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:08:49,672 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 402 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:49,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 461 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-12-16 01:08:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 285. [2021-12-16 01:08:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 243 states have (on average 1.4279835390946503) internal successors, (347), 245 states have internal predecessors, (347), 28 states have call successors, (28), 12 states have call predecessors, (28), 13 states have return successors, (31), 29 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-16 01:08:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 406 transitions. [2021-12-16 01:08:49,684 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 406 transitions. Word has length 79 [2021-12-16 01:08:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:49,685 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 406 transitions. [2021-12-16 01:08:49,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 406 transitions. [2021-12-16 01:08:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:49,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:49,685 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:49,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 01:08:49,686 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash -354934789, now seen corresponding path program 1 times [2021-12-16 01:08:49,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:49,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97261037] [2021-12-16 01:08:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:49,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,733 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-16 01:08:49,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:49,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97261037] [2021-12-16 01:08:49,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97261037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:49,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:49,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:08:49,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631950795] [2021-12-16 01:08:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:49,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:08:49,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:49,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:08:49,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:49,737 INFO L87 Difference]: Start difference. First operand 285 states and 406 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:50,289 INFO L93 Difference]: Finished difference Result 986 states and 1421 transitions. [2021-12-16 01:08:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:08:50,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:50,293 INFO L225 Difference]: With dead ends: 986 [2021-12-16 01:08:50,293 INFO L226 Difference]: Without dead ends: 713 [2021-12-16 01:08:50,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-16 01:08:50,294 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 618 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:50,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 869 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 01:08:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-12-16 01:08:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 544. [2021-12-16 01:08:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 465 states have (on average 1.421505376344086) internal successors, (661), 470 states have internal predecessors, (661), 52 states have call successors, (52), 24 states have call predecessors, (52), 26 states have return successors, (57), 51 states have call predecessors, (57), 52 states have call successors, (57) [2021-12-16 01:08:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 770 transitions. [2021-12-16 01:08:50,316 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 770 transitions. Word has length 79 [2021-12-16 01:08:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:50,316 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 770 transitions. [2021-12-16 01:08:50,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 770 transitions. [2021-12-16 01:08:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:50,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:50,317 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:50,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 01:08:50,318 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:50,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1463063428, now seen corresponding path program 1 times [2021-12-16 01:08:50,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:50,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23655682] [2021-12-16 01:08:50,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:50,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,387 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-16 01:08:50,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:50,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23655682] [2021-12-16 01:08:50,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23655682] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:50,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:50,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:50,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941874944] [2021-12-16 01:08:50,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:50,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:50,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:50,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:50,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:50,389 INFO L87 Difference]: Start difference. First operand 544 states and 770 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:50,854 INFO L93 Difference]: Finished difference Result 1338 states and 1935 transitions. [2021-12-16 01:08:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 01:08:50,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:50,858 INFO L225 Difference]: With dead ends: 1338 [2021-12-16 01:08:50,858 INFO L226 Difference]: Without dead ends: 806 [2021-12-16 01:08:50,859 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-16 01:08:50,860 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 343 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:50,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 790 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-12-16 01:08:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 550. [2021-12-16 01:08:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 471 states have (on average 1.4118895966029723) internal successors, (665), 476 states have internal predecessors, (665), 52 states have call successors, (52), 24 states have call predecessors, (52), 26 states have return successors, (57), 51 states have call predecessors, (57), 52 states have call successors, (57) [2021-12-16 01:08:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 774 transitions. [2021-12-16 01:08:50,884 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 774 transitions. Word has length 79 [2021-12-16 01:08:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:50,884 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 774 transitions. [2021-12-16 01:08:50,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 774 transitions. [2021-12-16 01:08:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:50,885 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:50,885 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:50,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 01:08:50,886 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash 803317758, now seen corresponding path program 1 times [2021-12-16 01:08:50,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:50,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165359587] [2021-12-16 01:08:50,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:50,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,946 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-16 01:08:50,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:50,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165359587] [2021-12-16 01:08:50,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165359587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:50,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:50,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:50,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642801797] [2021-12-16 01:08:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:50,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:50,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:50,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:50,948 INFO L87 Difference]: Start difference. First operand 550 states and 774 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:51,452 INFO L93 Difference]: Finished difference Result 1416 states and 2046 transitions. [2021-12-16 01:08:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 01:08:51,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:51,456 INFO L225 Difference]: With dead ends: 1416 [2021-12-16 01:08:51,456 INFO L226 Difference]: Without dead ends: 878 [2021-12-16 01:08:51,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-16 01:08:51,458 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 343 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:51,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 782 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2021-12-16 01:08:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 562. [2021-12-16 01:08:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 483 states have (on average 1.401656314699793) internal successors, (677), 488 states have internal predecessors, (677), 52 states have call successors, (52), 24 states have call predecessors, (52), 26 states have return successors, (57), 51 states have call predecessors, (57), 52 states have call successors, (57) [2021-12-16 01:08:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2021-12-16 01:08:51,484 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 786 transitions. Word has length 79 [2021-12-16 01:08:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:51,484 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-16 01:08:51,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 786 transitions. [2021-12-16 01:08:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:51,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:51,485 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:51,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 01:08:51,485 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:51,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1696804096, now seen corresponding path program 1 times [2021-12-16 01:08:51,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:51,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430224692] [2021-12-16 01:08:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:51,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,561 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-16 01:08:51,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:51,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430224692] [2021-12-16 01:08:51,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430224692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:51,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:51,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:51,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913607369] [2021-12-16 01:08:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:51,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:51,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:51,563 INFO L87 Difference]: Start difference. First operand 562 states and 786 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:52,575 INFO L93 Difference]: Finished difference Result 3173 states and 4609 transitions. [2021-12-16 01:08:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 01:08:52,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:52,586 INFO L225 Difference]: With dead ends: 3173 [2021-12-16 01:08:52,586 INFO L226 Difference]: Without dead ends: 2623 [2021-12-16 01:08:52,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-16 01:08:52,589 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 1049 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:52,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1068 Valid, 1085 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 01:08:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2021-12-16 01:08:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2000. [2021-12-16 01:08:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1719 states have (on average 1.3979057591623036) internal successors, (2403), 1736 states have internal predecessors, (2403), 176 states have call successors, (176), 96 states have call predecessors, (176), 104 states have return successors, (257), 169 states have call predecessors, (257), 176 states have call successors, (257) [2021-12-16 01:08:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2836 transitions. [2021-12-16 01:08:52,694 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2836 transitions. Word has length 79 [2021-12-16 01:08:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:52,695 INFO L470 AbstractCegarLoop]: Abstraction has 2000 states and 2836 transitions. [2021-12-16 01:08:52,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2836 transitions. [2021-12-16 01:08:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:52,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:52,696 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:52,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 01:08:52,696 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash -699632895, now seen corresponding path program 1 times [2021-12-16 01:08:52,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:52,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445931907] [2021-12-16 01:08:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:52,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:52,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:52,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:52,765 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-16 01:08:52,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:52,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445931907] [2021-12-16 01:08:52,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445931907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:52,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:52,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:52,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904266838] [2021-12-16 01:08:52,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:52,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:52,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:52,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:52,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:52,768 INFO L87 Difference]: Start difference. First operand 2000 states and 2836 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:53,348 INFO L93 Difference]: Finished difference Result 4728 states and 6993 transitions. [2021-12-16 01:08:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 01:08:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:53,361 INFO L225 Difference]: With dead ends: 4728 [2021-12-16 01:08:53,362 INFO L226 Difference]: Without dead ends: 2740 [2021-12-16 01:08:53,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-16 01:08:53,369 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 280 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:53,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 788 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2021-12-16 01:08:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2024. [2021-12-16 01:08:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1743 states have (on average 1.3878370625358578) internal successors, (2419), 1760 states have internal predecessors, (2419), 176 states have call successors, (176), 96 states have call predecessors, (176), 104 states have return successors, (257), 169 states have call predecessors, (257), 176 states have call successors, (257) [2021-12-16 01:08:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2852 transitions. [2021-12-16 01:08:53,500 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2852 transitions. Word has length 79 [2021-12-16 01:08:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:53,501 INFO L470 AbstractCegarLoop]: Abstraction has 2024 states and 2852 transitions. [2021-12-16 01:08:53,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2852 transitions. [2021-12-16 01:08:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 01:08:53,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:53,502 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:53,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 01:08:53,503 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1749967235, now seen corresponding path program 1 times [2021-12-16 01:08:53,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:53,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164211121] [2021-12-16 01:08:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:53,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,561 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-16 01:08:53,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:53,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164211121] [2021-12-16 01:08:53,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164211121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:53,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:53,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:08:53,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705018402] [2021-12-16 01:08:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:53,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:08:53,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:08:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:53,563 INFO L87 Difference]: Start difference. First operand 2024 states and 2852 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:54,265 INFO L93 Difference]: Finished difference Result 7056 states and 10157 transitions. [2021-12-16 01:08:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:08:54,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2021-12-16 01:08:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:54,284 INFO L225 Difference]: With dead ends: 7056 [2021-12-16 01:08:54,284 INFO L226 Difference]: Without dead ends: 5044 [2021-12-16 01:08:54,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-16 01:08:54,292 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 743 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:54,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [767 Valid, 813 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 01:08:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2021-12-16 01:08:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 3968. [2021-12-16 01:08:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3411 states have (on average 1.376429199648197) internal successors, (4695), 3444 states have internal predecessors, (4695), 348 states have call successors, (348), 192 states have call predecessors, (348), 208 states have return successors, (509), 333 states have call predecessors, (509), 348 states have call successors, (509) [2021-12-16 01:08:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5552 transitions. [2021-12-16 01:08:54,509 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5552 transitions. Word has length 79 [2021-12-16 01:08:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:54,510 INFO L470 AbstractCegarLoop]: Abstraction has 3968 states and 5552 transitions. [2021-12-16 01:08:54,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5552 transitions. [2021-12-16 01:08:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-16 01:08:54,511 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:54,512 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:54,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 01:08:54,512 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash 423038380, now seen corresponding path program 1 times [2021-12-16 01:08:54,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:54,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45146373] [2021-12-16 01:08:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:54,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-16 01:08:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 01:08:54,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:54,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45146373] [2021-12-16 01:08:54,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45146373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:54,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:54,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:54,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652071749] [2021-12-16 01:08:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:54,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:54,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:54,589 INFO L87 Difference]: Start difference. First operand 3968 states and 5552 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:55,236 INFO L93 Difference]: Finished difference Result 9116 states and 13236 transitions. [2021-12-16 01:08:55,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 01:08:55,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2021-12-16 01:08:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:55,260 INFO L225 Difference]: With dead ends: 9116 [2021-12-16 01:08:55,261 INFO L226 Difference]: Without dead ends: 5160 [2021-12-16 01:08:55,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-16 01:08:55,272 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 211 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:55,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 757 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5160 states. [2021-12-16 01:08:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5160 to 4016. [2021-12-16 01:08:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4016 states, 3459 states have (on average 1.3665799363978028) internal successors, (4727), 3492 states have internal predecessors, (4727), 348 states have call successors, (348), 192 states have call predecessors, (348), 208 states have return successors, (509), 333 states have call predecessors, (509), 348 states have call successors, (509) [2021-12-16 01:08:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 5584 transitions. [2021-12-16 01:08:55,514 INFO L78 Accepts]: Start accepts. Automaton has 4016 states and 5584 transitions. Word has length 97 [2021-12-16 01:08:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:55,514 INFO L470 AbstractCegarLoop]: Abstraction has 4016 states and 5584 transitions. [2021-12-16 01:08:55,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4016 states and 5584 transitions. [2021-12-16 01:08:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-16 01:08:55,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:55,517 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:55,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 01:08:55,517 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1605547730, now seen corresponding path program 1 times [2021-12-16 01:08:55,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:55,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780075423] [2021-12-16 01:08:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:55,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-16 01:08:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 01:08:55,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:55,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780075423] [2021-12-16 01:08:55,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780075423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:55,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:55,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:55,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394849986] [2021-12-16 01:08:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:55,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:55,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:55,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:55,593 INFO L87 Difference]: Start difference. First operand 4016 states and 5584 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:56,343 INFO L93 Difference]: Finished difference Result 10867 states and 14912 transitions. [2021-12-16 01:08:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:08:56,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2021-12-16 01:08:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:56,365 INFO L225 Difference]: With dead ends: 10867 [2021-12-16 01:08:56,365 INFO L226 Difference]: Without dead ends: 6864 [2021-12-16 01:08:56,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-16 01:08:56,376 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 512 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:56,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 589 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6864 states. [2021-12-16 01:08:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6864 to 5056. [2021-12-16 01:08:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 4467 states have (on average 1.3089321692411013) internal successors, (5847), 4484 states have internal predecessors, (5847), 348 states have call successors, (348), 224 states have call predecessors, (348), 240 states have return successors, (537), 349 states have call predecessors, (537), 348 states have call successors, (537) [2021-12-16 01:08:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 6732 transitions. [2021-12-16 01:08:56,744 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 6732 transitions. Word has length 97 [2021-12-16 01:08:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:56,744 INFO L470 AbstractCegarLoop]: Abstraction has 5056 states and 6732 transitions. [2021-12-16 01:08:56,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 6732 transitions. [2021-12-16 01:08:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-16 01:08:56,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:56,746 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:56,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 01:08:56,746 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1958636112, now seen corresponding path program 1 times [2021-12-16 01:08:56,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:56,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952199086] [2021-12-16 01:08:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:56,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-16 01:08:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 01:08:56,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:56,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952199086] [2021-12-16 01:08:56,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952199086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:56,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:56,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:56,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242760452] [2021-12-16 01:08:56,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:56,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:56,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:56,812 INFO L87 Difference]: Start difference. First operand 5056 states and 6732 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:57,552 INFO L93 Difference]: Finished difference Result 13061 states and 17426 transitions. [2021-12-16 01:08:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:08:57,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2021-12-16 01:08:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:57,571 INFO L225 Difference]: With dead ends: 13061 [2021-12-16 01:08:57,572 INFO L226 Difference]: Without dead ends: 8018 [2021-12-16 01:08:57,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-16 01:08:57,582 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 673 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:57,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 462 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8018 states. [2021-12-16 01:08:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8018 to 6722. [2021-12-16 01:08:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6722 states, 5955 states have (on average 1.2827875734676741) internal successors, (7639), 6020 states have internal predecessors, (7639), 414 states have call successors, (414), 288 states have call predecessors, (414), 352 states have return successors, (759), 415 states have call predecessors, (759), 414 states have call successors, (759) [2021-12-16 01:08:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6722 states to 6722 states and 8812 transitions. [2021-12-16 01:08:57,953 INFO L78 Accepts]: Start accepts. Automaton has 6722 states and 8812 transitions. Word has length 97 [2021-12-16 01:08:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:57,954 INFO L470 AbstractCegarLoop]: Abstraction has 6722 states and 8812 transitions. [2021-12-16 01:08:57,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 6722 states and 8812 transitions. [2021-12-16 01:08:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-16 01:08:57,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:57,957 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:57,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 01:08:57,957 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:57,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash -30363410, now seen corresponding path program 1 times [2021-12-16 01:08:57,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:57,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214044617] [2021-12-16 01:08:57,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:57,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:58,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:58,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:58,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:58,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-16 01:08:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 01:08:58,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:58,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214044617] [2021-12-16 01:08:58,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214044617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:58,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:58,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:08:58,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305782241] [2021-12-16 01:08:58,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:58,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:08:58,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:58,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:08:58,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:08:58,049 INFO L87 Difference]: Start difference. First operand 6722 states and 8812 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:59,165 INFO L93 Difference]: Finished difference Result 11536 states and 15188 transitions. [2021-12-16 01:08:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 01:08:59,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2021-12-16 01:08:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:59,195 INFO L225 Difference]: With dead ends: 11536 [2021-12-16 01:08:59,195 INFO L226 Difference]: Without dead ends: 8101 [2021-12-16 01:08:59,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-12-16 01:08:59,207 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 603 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:59,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 782 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 01:08:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8101 states. [2021-12-16 01:08:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8101 to 6562. [2021-12-16 01:08:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6562 states, 5827 states have (on average 1.2670327784451691) internal successors, (7383), 5860 states have internal predecessors, (7383), 414 states have call successors, (414), 288 states have call predecessors, (414), 320 states have return successors, (660), 414 states have call predecessors, (660), 414 states have call successors, (660) [2021-12-16 01:08:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 8457 transitions. [2021-12-16 01:08:59,564 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 8457 transitions. Word has length 97 [2021-12-16 01:08:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:59,564 INFO L470 AbstractCegarLoop]: Abstraction has 6562 states and 8457 transitions. [2021-12-16 01:08:59,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:08:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 8457 transitions. [2021-12-16 01:08:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-16 01:08:59,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:59,566 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:59,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 01:08:59,566 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:59,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2079751252, now seen corresponding path program 1 times [2021-12-16 01:08:59,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:59,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975320012] [2021-12-16 01:08:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:59,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:59,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:08:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:08:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:08:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:59,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:08:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-16 01:08:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 01:08:59,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:59,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975320012] [2021-12-16 01:08:59,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975320012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:59,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:59,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:59,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074751553] [2021-12-16 01:08:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:59,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:59,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:59,629 INFO L87 Difference]: Start difference. First operand 6562 states and 8457 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:09:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:00,495 INFO L93 Difference]: Finished difference Result 15461 states and 19964 transitions. [2021-12-16 01:09:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:09:00,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2021-12-16 01:09:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:00,516 INFO L225 Difference]: With dead ends: 15461 [2021-12-16 01:09:00,516 INFO L226 Difference]: Without dead ends: 8914 [2021-12-16 01:09:00,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-16 01:09:00,530 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 642 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:00,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 482 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:09:00,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8914 states. [2021-12-16 01:09:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8914 to 7530. [2021-12-16 01:09:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7530 states, 6723 states have (on average 1.2314442957013239) internal successors, (8279), 6756 states have internal predecessors, (8279), 430 states have call successors, (430), 336 states have call predecessors, (430), 376 states have return successors, (708), 438 states have call predecessors, (708), 430 states have call successors, (708) [2021-12-16 01:09:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7530 states to 7530 states and 9417 transitions. [2021-12-16 01:09:00,979 INFO L78 Accepts]: Start accepts. Automaton has 7530 states and 9417 transitions. Word has length 97 [2021-12-16 01:09:00,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:00,979 INFO L470 AbstractCegarLoop]: Abstraction has 7530 states and 9417 transitions. [2021-12-16 01:09:00,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:09:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 7530 states and 9417 transitions. [2021-12-16 01:09:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-16 01:09:00,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:00,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:00,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 01:09:00,981 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1317822766, now seen corresponding path program 1 times [2021-12-16 01:09:00,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:00,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101606440] [2021-12-16 01:09:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:00,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:00,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:01,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:01,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-16 01:09:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 01:09:01,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:01,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101606440] [2021-12-16 01:09:01,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101606440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:01,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:09:01,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:09:01,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126514903] [2021-12-16 01:09:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:01,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:09:01,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:01,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:09:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:01,042 INFO L87 Difference]: Start difference. First operand 7530 states and 9417 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:09:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:01,928 INFO L93 Difference]: Finished difference Result 16637 states and 21080 transitions. [2021-12-16 01:09:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:09:01,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2021-12-16 01:09:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:01,949 INFO L225 Difference]: With dead ends: 16637 [2021-12-16 01:09:01,950 INFO L226 Difference]: Without dead ends: 9122 [2021-12-16 01:09:01,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-16 01:09:01,963 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 512 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:01,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 530 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:09:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9122 states. [2021-12-16 01:09:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9122 to 7686. [2021-12-16 01:09:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7686 states, 6855 states have (on average 1.2036469730123998) internal successors, (8251), 6888 states have internal predecessors, (8251), 438 states have call successors, (438), 352 states have call predecessors, (438), 392 states have return successors, (732), 446 states have call predecessors, (732), 438 states have call successors, (732) [2021-12-16 01:09:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7686 states to 7686 states and 9421 transitions. [2021-12-16 01:09:02,526 INFO L78 Accepts]: Start accepts. Automaton has 7686 states and 9421 transitions. Word has length 97 [2021-12-16 01:09:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:02,526 INFO L470 AbstractCegarLoop]: Abstraction has 7686 states and 9421 transitions. [2021-12-16 01:09:02,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:09:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 7686 states and 9421 transitions. [2021-12-16 01:09:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-16 01:09:02,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:02,530 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:02,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 01:09:02,530 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1565969260, now seen corresponding path program 1 times [2021-12-16 01:09:02,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:02,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256863768] [2021-12-16 01:09:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:02,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:02,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:02,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:02,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-16 01:09:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 01:09:02,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:02,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256863768] [2021-12-16 01:09:02,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256863768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:02,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:09:02,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:09:02,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811987415] [2021-12-16 01:09:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:02,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:09:02,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:02,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:09:02,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:02,583 INFO L87 Difference]: Start difference. First operand 7686 states and 9421 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:09:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:03,334 INFO L93 Difference]: Finished difference Result 16661 states and 20516 transitions. [2021-12-16 01:09:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 01:09:03,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 97 [2021-12-16 01:09:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:03,360 INFO L225 Difference]: With dead ends: 16661 [2021-12-16 01:09:03,361 INFO L226 Difference]: Without dead ends: 8990 [2021-12-16 01:09:03,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-16 01:09:03,375 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 563 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:03,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 431 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:09:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8990 states. [2021-12-16 01:09:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8990 to 8146. [2021-12-16 01:09:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8146 states, 7279 states have (on average 1.1703530704767138) internal successors, (8519), 7320 states have internal predecessors, (8519), 438 states have call successors, (438), 368 states have call predecessors, (438), 428 states have return successors, (756), 458 states have call predecessors, (756), 438 states have call successors, (756) [2021-12-16 01:09:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8146 states to 8146 states and 9713 transitions. [2021-12-16 01:09:03,828 INFO L78 Accepts]: Start accepts. Automaton has 8146 states and 9713 transitions. Word has length 97 [2021-12-16 01:09:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:03,828 INFO L470 AbstractCegarLoop]: Abstraction has 8146 states and 9713 transitions. [2021-12-16 01:09:03,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 01:09:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8146 states and 9713 transitions. [2021-12-16 01:09:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-16 01:09:03,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:03,830 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:03,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 01:09:03,830 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:03,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1989615982, now seen corresponding path program 1 times [2021-12-16 01:09:03,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:03,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786776217] [2021-12-16 01:09:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:03,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-16 01:09:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-16 01:09:03,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:03,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786776217] [2021-12-16 01:09:03,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786776217] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:09:03,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360112606] [2021-12-16 01:09:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:03,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:09:03,890 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-16 01:09:03,893 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-16 01:09:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:03,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:09:03,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:09:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:09:04,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:09:04,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360112606] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:04,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:09:04,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 01:09:04,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798224072] [2021-12-16 01:09:04,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:04,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:09:04,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:04,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:09:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:04,148 INFO L87 Difference]: Start difference. First operand 8146 states and 9713 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 01:09:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:04,902 INFO L93 Difference]: Finished difference Result 23413 states and 28024 transitions. [2021-12-16 01:09:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:09:04,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 97 [2021-12-16 01:09:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:04,932 INFO L225 Difference]: With dead ends: 23413 [2021-12-16 01:09:04,932 INFO L226 Difference]: Without dead ends: 11346 [2021-12-16 01:09:04,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:04,952 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 162 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:04,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 562 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:09:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11346 states. [2021-12-16 01:09:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11346 to 11346. [2021-12-16 01:09:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11346 states, 10139 states have (on average 1.1697406055824047) internal successors, (11860), 10196 states have internal predecessors, (11860), 606 states have call successors, (606), 512 states have call predecessors, (606), 600 states have return successors, (1120), 638 states have call predecessors, (1120), 606 states have call successors, (1120) [2021-12-16 01:09:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11346 states to 11346 states and 13586 transitions. [2021-12-16 01:09:05,625 INFO L78 Accepts]: Start accepts. Automaton has 11346 states and 13586 transitions. Word has length 97 [2021-12-16 01:09:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:05,625 INFO L470 AbstractCegarLoop]: Abstraction has 11346 states and 13586 transitions. [2021-12-16 01:09:05,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 01:09:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 11346 states and 13586 transitions. [2021-12-16 01:09:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-12-16 01:09:05,632 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:05,632 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:05,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 01:09:05,848 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-16 01:09:05,848 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash -176909290, now seen corresponding path program 1 times [2021-12-16 01:09:05,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:05,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170472434] [2021-12-16 01:09:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:05,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:05,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:05,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:05,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 01:09:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-16 01:09:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:05,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-16 01:09:05,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:05,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170472434] [2021-12-16 01:09:05,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170472434] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:09:05,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915849753] [2021-12-16 01:09:05,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:05,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:05,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:09:05,920 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-16 01:09:05,968 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-16 01:09:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:06,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:09:06,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:09:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 01:09:06,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:09:06,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915849753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:06,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:09:06,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2021-12-16 01:09:06,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393899290] [2021-12-16 01:09:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:06,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:09:06,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:06,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:09:06,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:06,245 INFO L87 Difference]: Start difference. First operand 11346 states and 13586 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 01:09:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:07,065 INFO L93 Difference]: Finished difference Result 24833 states and 29974 transitions. [2021-12-16 01:09:07,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:09:07,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 140 [2021-12-16 01:09:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:07,108 INFO L225 Difference]: With dead ends: 24833 [2021-12-16 01:09:07,108 INFO L226 Difference]: Without dead ends: 15194 [2021-12-16 01:09:07,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:07,130 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 97 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:07,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 382 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:09:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15194 states. [2021-12-16 01:09:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15194 to 15066. [2021-12-16 01:09:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15066 states, 13459 states have (on average 1.1659112861282412) internal successors, (15692), 13532 states have internal predecessors, (15692), 814 states have call successors, (814), 688 states have call predecessors, (814), 792 states have return successors, (1420), 846 states have call predecessors, (1420), 814 states have call successors, (1420) [2021-12-16 01:09:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15066 states to 15066 states and 17926 transitions. [2021-12-16 01:09:08,207 INFO L78 Accepts]: Start accepts. Automaton has 15066 states and 17926 transitions. Word has length 140 [2021-12-16 01:09:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:08,207 INFO L470 AbstractCegarLoop]: Abstraction has 15066 states and 17926 transitions. [2021-12-16 01:09:08,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 01:09:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 15066 states and 17926 transitions. [2021-12-16 01:09:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-12-16 01:09:08,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:08,214 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:08,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 01:09:08,425 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,SelfDestructingSolverStorable20 [2021-12-16 01:09:08,425 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:08,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1908560924, now seen corresponding path program 1 times [2021-12-16 01:09:08,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:08,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331503861] [2021-12-16 01:09:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:08,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 01:09:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-16 01:09:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 01:09:08,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:08,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331503861] [2021-12-16 01:09:08,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331503861] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:09:08,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851315733] [2021-12-16 01:09:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:08,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:09:08,498 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-16 01:09:08,499 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-16 01:09:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:08,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:09:08,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:09:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:09:08,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:09:08,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851315733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:08,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:09:08,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 01:09:08,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988934052] [2021-12-16 01:09:08,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:08,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:09:08,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:08,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:09:08,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:08,745 INFO L87 Difference]: Start difference. First operand 15066 states and 17926 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-16 01:09:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:10,150 INFO L93 Difference]: Finished difference Result 43811 states and 52212 transitions. [2021-12-16 01:09:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:09:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 140 [2021-12-16 01:09:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:10,213 INFO L225 Difference]: With dead ends: 43811 [2021-12-16 01:09:10,213 INFO L226 Difference]: Without dead ends: 23397 [2021-12-16 01:09:10,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:10,250 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 154 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:10,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 554 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:09:10,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23397 states. [2021-12-16 01:09:11,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23397 to 23378. [2021-12-16 01:09:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23378 states, 20883 states have (on average 1.165014605181248) internal successors, (24329), 20992 states have internal predecessors, (24329), 1270 states have call successors, (1270), 1072 states have call predecessors, (1270), 1224 states have return successors, (2248), 1314 states have call predecessors, (2248), 1270 states have call successors, (2248) [2021-12-16 01:09:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23378 states to 23378 states and 27847 transitions. [2021-12-16 01:09:11,577 INFO L78 Accepts]: Start accepts. Automaton has 23378 states and 27847 transitions. Word has length 140 [2021-12-16 01:09:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:11,577 INFO L470 AbstractCegarLoop]: Abstraction has 23378 states and 27847 transitions. [2021-12-16 01:09:11,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-16 01:09:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 23378 states and 27847 transitions. [2021-12-16 01:09:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-12-16 01:09:11,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:11,589 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:11,607 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-16 01:09:11,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:11,809 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash 677473852, now seen corresponding path program 1 times [2021-12-16 01:09:11,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:11,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289735937] [2021-12-16 01:09:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:11,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 01:09:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-16 01:09:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-16 01:09:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-16 01:09:11,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289735937] [2021-12-16 01:09:11,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289735937] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:09:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825027821] [2021-12-16 01:09:11,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:11,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:09:11,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:09:11,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 01:09:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:11,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:09:11,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:09:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 01:09:12,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:09:12,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825027821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:12,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:09:12,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 01:09:12,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675350451] [2021-12-16 01:09:12,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:12,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:09:12,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:09:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:12,164 INFO L87 Difference]: Start difference. First operand 23378 states and 27847 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-16 01:09:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:13,624 INFO L93 Difference]: Finished difference Result 53330 states and 63654 transitions. [2021-12-16 01:09:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:09:13,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 183 [2021-12-16 01:09:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:13,684 INFO L225 Difference]: With dead ends: 53330 [2021-12-16 01:09:13,685 INFO L226 Difference]: Without dead ends: 23081 [2021-12-16 01:09:13,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:09:13,736 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 150 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:13,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 518 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:09:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23081 states. [2021-12-16 01:09:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23081 to 21756. [2021-12-16 01:09:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21756 states, 19477 states have (on average 1.1636288956204754) internal successors, (22664), 19526 states have internal predecessors, (22664), 1162 states have call successors, (1162), 976 states have call predecessors, (1162), 1116 states have return successors, (1992), 1254 states have call predecessors, (1992), 1162 states have call successors, (1992) [2021-12-16 01:09:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 25818 transitions. [2021-12-16 01:09:15,312 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 25818 transitions. Word has length 183 [2021-12-16 01:09:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:15,312 INFO L470 AbstractCegarLoop]: Abstraction has 21756 states and 25818 transitions. [2021-12-16 01:09:15,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-16 01:09:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 25818 transitions. [2021-12-16 01:09:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2021-12-16 01:09:15,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:15,326 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 01:09:15,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 01:09:15,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:15,543 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash 239996077, now seen corresponding path program 1 times [2021-12-16 01:09:15,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:15,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983015465] [2021-12-16 01:09:15,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:15,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 01:09:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 01:09:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-16 01:09:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-16 01:09:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 5 proven. 75 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-12-16 01:09:15,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:15,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983015465] [2021-12-16 01:09:15,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983015465] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:09:15,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090053660] [2021-12-16 01:09:15,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:15,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:15,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:09:15,624 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:09:15,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 01:09:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:15,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:09:15,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:09:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-16 01:09:15,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:09:15,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090053660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:15,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:09:15,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-16 01:09:15,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417621886] [2021-12-16 01:09:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:15,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:09:15,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:15,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:09:15,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:09:15,956 INFO L87 Difference]: Start difference. First operand 21756 states and 25818 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-16 01:09:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:17,880 INFO L93 Difference]: Finished difference Result 61213 states and 73206 transitions. [2021-12-16 01:09:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:09:17,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 221 [2021-12-16 01:09:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:17,988 INFO L225 Difference]: With dead ends: 61213 [2021-12-16 01:09:17,988 INFO L226 Difference]: Without dead ends: 39472 [2021-12-16 01:09:18,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:09:18,033 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 169 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:18,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 423 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:09:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39472 states. [2021-12-16 01:09:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39472 to 39451. [2021-12-16 01:09:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39451 states, 35279 states have (on average 1.1569488931092151) internal successors, (40816), 35353 states have internal predecessors, (40816), 2143 states have call successors, (2143), 1772 states have call predecessors, (2143), 2028 states have return successors, (3983), 2327 states have call predecessors, (3983), 2143 states have call successors, (3983) [2021-12-16 01:09:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39451 states to 39451 states and 46942 transitions. [2021-12-16 01:09:20,280 INFO L78 Accepts]: Start accepts. Automaton has 39451 states and 46942 transitions. Word has length 221 [2021-12-16 01:09:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:20,280 INFO L470 AbstractCegarLoop]: Abstraction has 39451 states and 46942 transitions. [2021-12-16 01:09:20,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-16 01:09:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 39451 states and 46942 transitions. [2021-12-16 01:09:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-12-16 01:09:20,302 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:20,302 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 01:09:20,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-16 01:09:20,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-16 01:09:20,503 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 417238553, now seen corresponding path program 1 times [2021-12-16 01:09:20,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:20,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024601142] [2021-12-16 01:09:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:20,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 01:09:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-16 01:09:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-16 01:09:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-16 01:09:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 33 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-12-16 01:09:20,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:20,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024601142] [2021-12-16 01:09:20,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024601142] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:09:20,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706471363] [2021-12-16 01:09:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:20,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:20,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:09:20,577 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:09:20,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 01:09:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:20,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:09:20,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:09:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-12-16 01:09:20,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:09:20,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706471363] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:20,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:09:20,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-16 01:09:20,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121879517] [2021-12-16 01:09:20,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:20,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:09:20,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:09:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:09:20,944 INFO L87 Difference]: Start difference. First operand 39451 states and 46942 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-16 01:09:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:22,812 INFO L93 Difference]: Finished difference Result 63892 states and 77188 transitions. [2021-12-16 01:09:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:09:22,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 222 [2021-12-16 01:09:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:22,908 INFO L225 Difference]: With dead ends: 63892 [2021-12-16 01:09:22,909 INFO L226 Difference]: Without dead ends: 34243 [2021-12-16 01:09:22,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 245 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-16 01:09:22,976 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 141 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:22,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 537 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:09:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34243 states. [2021-12-16 01:09:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34243 to 33487. [2021-12-16 01:09:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33487 states, 29935 states have (on average 1.138333054952397) internal successors, (34076), 29993 states have internal predecessors, (34076), 1835 states have call successors, (1835), 1520 states have call predecessors, (1835), 1716 states have return successors, (3167), 1975 states have call predecessors, (3167), 1835 states have call successors, (3167) [2021-12-16 01:09:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33487 states to 33487 states and 39078 transitions. [2021-12-16 01:09:25,215 INFO L78 Accepts]: Start accepts. Automaton has 33487 states and 39078 transitions. Word has length 222 [2021-12-16 01:09:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:25,216 INFO L470 AbstractCegarLoop]: Abstraction has 33487 states and 39078 transitions. [2021-12-16 01:09:25,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-16 01:09:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 33487 states and 39078 transitions. [2021-12-16 01:09:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-12-16 01:09:25,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:25,236 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:25,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-16 01:09:25,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:25,437 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1059063945, now seen corresponding path program 1 times [2021-12-16 01:09:25,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:25,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158450813] [2021-12-16 01:09:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:25,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 01:09:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-16 01:09:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-16 01:09:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-16 01:09:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-12-16 01:09:25,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:25,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158450813] [2021-12-16 01:09:25,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158450813] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:09:25,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926451794] [2021-12-16 01:09:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:25,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:09:25,511 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:09:25,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 01:09:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:25,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:09:25,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:09:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-16 01:09:25,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:09:25,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926451794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:25,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:09:25,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-16 01:09:25,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595768803] [2021-12-16 01:09:25,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:25,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:09:25,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:25,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:09:25,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:09:25,830 INFO L87 Difference]: Start difference. First operand 33487 states and 39078 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-16 01:09:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:27,548 INFO L93 Difference]: Finished difference Result 53976 states and 64050 transitions. [2021-12-16 01:09:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:09:27,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 224 [2021-12-16 01:09:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:27,636 INFO L225 Difference]: With dead ends: 53976 [2021-12-16 01:09:27,636 INFO L226 Difference]: Without dead ends: 33375 [2021-12-16 01:09:27,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 247 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-16 01:09:27,683 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 139 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 549 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-16 01:09:27,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 549 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:09:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33375 states. [2021-12-16 01:09:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33375 to 33319. [2021-12-16 01:09:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33319 states, 29767 states have (on average 1.1256088957570465) internal successors, (33506), 29825 states have internal predecessors, (33506), 1835 states have call successors, (1835), 1520 states have call predecessors, (1835), 1716 states have return successors, (3167), 1975 states have call predecessors, (3167), 1835 states have call successors, (3167) [2021-12-16 01:09:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33319 states to 33319 states and 38508 transitions. [2021-12-16 01:09:29,658 INFO L78 Accepts]: Start accepts. Automaton has 33319 states and 38508 transitions. Word has length 224 [2021-12-16 01:09:29,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:29,659 INFO L470 AbstractCegarLoop]: Abstraction has 33319 states and 38508 transitions. [2021-12-16 01:09:29,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-16 01:09:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 33319 states and 38508 transitions. [2021-12-16 01:09:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-12-16 01:09:29,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:29,677 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:29,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 01:09:29,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:29,877 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash -529385757, now seen corresponding path program 1 times [2021-12-16 01:09:29,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:29,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138561561] [2021-12-16 01:09:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:29,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 01:09:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-16 01:09:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-16 01:09:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-16 01:09:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 64 proven. 26 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-12-16 01:09:29,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:29,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138561561] [2021-12-16 01:09:29,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138561561] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:09:29,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86779662] [2021-12-16 01:09:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:29,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:09:29,951 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:09:29,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 01:09:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:30,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:09:30,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:09:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-12-16 01:09:30,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:09:30,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86779662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:30,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:09:30,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-16 01:09:30,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092671619] [2021-12-16 01:09:30,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:30,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:09:30,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:30,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:09:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:09:30,323 INFO L87 Difference]: Start difference. First operand 33319 states and 38508 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-16 01:09:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:31,464 INFO L93 Difference]: Finished difference Result 48888 states and 57030 transitions. [2021-12-16 01:09:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:09:31,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 226 [2021-12-16 01:09:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:31,505 INFO L225 Difference]: With dead ends: 48888 [2021-12-16 01:09:31,506 INFO L226 Difference]: Without dead ends: 13669 [2021-12-16 01:09:31,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 249 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-16 01:09:31,563 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 161 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 488 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-16 01:09:31,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 488 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:09:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13669 states. [2021-12-16 01:09:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13669 to 13653. [2021-12-16 01:09:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13653 states, 12177 states have (on average 1.102241931510224) internal successors, (13422), 12211 states have internal predecessors, (13422), 779 states have call successors, (779), 624 states have call predecessors, (779), 696 states have return successors, (1157), 819 states have call predecessors, (1157), 779 states have call successors, (1157) [2021-12-16 01:09:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13653 states to 13653 states and 15358 transitions. [2021-12-16 01:09:32,443 INFO L78 Accepts]: Start accepts. Automaton has 13653 states and 15358 transitions. Word has length 226 [2021-12-16 01:09:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:32,443 INFO L470 AbstractCegarLoop]: Abstraction has 13653 states and 15358 transitions. [2021-12-16 01:09:32,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-16 01:09:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 13653 states and 15358 transitions. [2021-12-16 01:09:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-12-16 01:09:32,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:32,453 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:32,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-16 01:09:32,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-16 01:09:32,667 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2060416461, now seen corresponding path program 1 times [2021-12-16 01:09:32,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:32,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812117569] [2021-12-16 01:09:32,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:32,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:09:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 01:09:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 01:09:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 01:09:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:09:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 01:09:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-16 01:09:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-16 01:09:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-16 01:09:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:09:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 55 proven. 60 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-12-16 01:09:32,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:09:32,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812117569] [2021-12-16 01:09:32,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812117569] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:09:32,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698127971] [2021-12-16 01:09:32,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:32,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:09:32,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:09:32,749 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:09:32,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 01:09:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:09:32,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:09:32,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:09:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-16 01:09:33,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:09:33,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698127971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:09:33,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:09:33,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-16 01:09:33,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526326137] [2021-12-16 01:09:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:09:33,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:09:33,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:09:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:09:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:09:33,085 INFO L87 Difference]: Start difference. First operand 13653 states and 15358 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 01:09:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:09:33,589 INFO L93 Difference]: Finished difference Result 16088 states and 18160 transitions. [2021-12-16 01:09:33,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:09:33,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 228 [2021-12-16 01:09:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:09:33,609 INFO L225 Difference]: With dead ends: 16088 [2021-12-16 01:09:33,609 INFO L226 Difference]: Without dead ends: 11347 [2021-12-16 01:09:33,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 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-16 01:09:33,619 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 106 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:09:33,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 452 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:09:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11347 states. [2021-12-16 01:09:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11347 to 11347. [2021-12-16 01:09:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11347 states, 10115 states have (on average 1.0991596638655463) internal successors, (11118), 10149 states have internal predecessors, (11118), 651 states have call successors, (651), 520 states have call predecessors, (651), 580 states have return successors, (907), 679 states have call predecessors, (907), 651 states have call successors, (907) [2021-12-16 01:09:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 12676 transitions. [2021-12-16 01:09:34,179 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 12676 transitions. Word has length 228 [2021-12-16 01:09:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:09:34,180 INFO L470 AbstractCegarLoop]: Abstraction has 11347 states and 12676 transitions. [2021-12-16 01:09:34,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 01:09:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 12676 transitions. [2021-12-16 01:09:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-12-16 01:09:34,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:09:34,189 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:09:34,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-16 01:09:34,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-16 01:09:34,402 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:09:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:09:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1990942215, now seen corresponding path program 1 times [2021-12-16 01:09:34,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:09:34,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275693422] [2021-12-16 01:09:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:09:34,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:09:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:09:34,414 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 01:09:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:09:34,476 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 01:09:34,477 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 01:09:34,477 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 01:09:34,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-16 01:09:34,482 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-16 01:09:34,484 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 01:09:34,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:09:34 BoogieIcfgContainer [2021-12-16 01:09:34,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 01:09:34,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 01:09:34,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 01:09:34,616 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 01:09:34,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:08:46" (3/4) ... [2021-12-16 01:09:34,617 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 01:09:34,745 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 01:09:34,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 01:09:34,746 INFO L158 Benchmark]: Toolchain (without parser) took 49567.44ms. Allocated memory was 86.0MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 53.9MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2021-12-16 01:09:34,746 INFO L158 Benchmark]: CDTParser took 9.85ms. Allocated memory is still 86.0MB. Free memory was 43.2MB in the beginning and 58.9MB in the end (delta: -15.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2021-12-16 01:09:34,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.65ms. Allocated memory was 86.0MB in the beginning and 117.4MB in the end (delta: 31.5MB). Free memory was 53.6MB in the beginning and 91.7MB in the end (delta: -38.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 01:09:34,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.60ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 89.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:09:34,747 INFO L158 Benchmark]: Boogie Preprocessor took 36.93ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 87.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:09:34,749 INFO L158 Benchmark]: RCFGBuilder took 458.96ms. Allocated memory is still 117.4MB. Free memory was 87.5MB in the beginning and 68.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-16 01:09:34,749 INFO L158 Benchmark]: TraceAbstraction took 48561.97ms. Allocated memory was 117.4MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 68.0MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2021-12-16 01:09:34,751 INFO L158 Benchmark]: Witness Printer took 130.20ms. Allocated memory is still 4.8GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-16 01:09:34,756 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 9.85ms. Allocated memory is still 86.0MB. Free memory was 43.2MB in the beginning and 58.9MB in the end (delta: -15.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.65ms. Allocated memory was 86.0MB in the beginning and 117.4MB in the end (delta: 31.5MB). Free memory was 53.6MB in the beginning and 91.7MB in the end (delta: -38.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.60ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 89.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.93ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 87.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.96ms. Allocated memory is still 117.4MB. Free memory was 87.5MB in the beginning and 68.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 48561.97ms. Allocated memory was 117.4MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 68.0MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 130.20ms. Allocated memory is still 4.8GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int t3_pc = 0; [L29] int m_st ; [L30] int t1_st ; [L31] int t2_st ; [L32] int t3_st ; [L33] int m_i ; [L34] int t1_i ; [L35] int t2_i ; [L36] int t3_i ; [L37] int M_E = 2; [L38] int T1_E = 2; [L39] int T2_E = 2; [L40] int T3_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0] [L697] int __retres1 ; [L701] CALL init_model() [L610] m_i = 1 [L611] t1_i = 1 [L612] t2_i = 1 [L613] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L701] RET init_model() [L702] CALL start_simulation() [L638] int kernel_st ; [L639] int tmp ; [L640] int tmp___0 ; [L644] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L645] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L646] CALL init_threads() [L281] COND TRUE m_i == 1 [L282] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L286] COND TRUE t1_i == 1 [L287] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L291] COND TRUE t2_i == 1 [L292] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L296] COND TRUE t3_i == 1 [L297] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L646] RET init_threads() [L647] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L418] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L423] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L428] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L433] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L438] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L443] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L448] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L647] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L648] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L209] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L216] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L228] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L235] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L245] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L247] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L254] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L264] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L266] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0] [L648] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L649] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L461] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L466] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L471] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L476] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L481] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L486] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L491] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L649] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L652] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L655] kernel_st = 1 [L656] CALL eval() [L337] int tmp ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L332] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L105] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L140] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L175] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L177] t3_pc = 1 [L178] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L399] RET transmit3() [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L332] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp_ndt_1) [L356] m_st = 1 [L357] CALL master() [L53] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L67] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND TRUE E_1 == 1 [L218] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND TRUE \read(tmp___0) [L519] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0] [L548] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L69] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L72] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L74] m_pc = 1 [L75] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L357] RET master() [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L113] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND TRUE E_2 == 1 [L237] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND TRUE \read(tmp___1) [L527] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0] [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L115] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L105] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L132] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L148] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L149] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND TRUE E_3 == 1 [L256] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=1, __retres1=1, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND TRUE \read(tmp___2) [L535] t3_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1] [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L149] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L150] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L140] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L167] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L183] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.4s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11142 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10955 mSDsluCounter, 17117 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9843 mSDsCounter, 1404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10268 IncrementalHoareTripleChecker+Invalid, 11672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1404 mSolverCounterUnsat, 7274 mSDtfsCounter, 10268 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2374 GetRequests, 2114 SyntacticMatches, 2 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39451occurred in iteration=24, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 15363 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 5219 NumberOfCodeBlocks, 5219 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4952 ConstructedInterpolants, 0 QuantifiedInterpolants, 9558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5238 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 37 InterpolantComputations, 28 PerfectInterpolantSequences, 2049/2359 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-16 01:09:34,796 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