/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 06:22:58,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 06:22:58,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 06:22:58,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 06:22:58,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 06:22:58,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 06:22:58,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 06:22:58,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 06:22:58,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 06:22:58,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 06:22:58,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 06:22:58,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 06:22:58,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 06:22:58,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 06:22:58,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 06:22:58,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 06:22:58,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 06:22:58,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 06:22:58,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 06:22:58,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 06:22:58,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 06:22:58,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 06:22:58,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 06:22:58,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 06:22:58,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 06:22:58,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 06:22:58,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 06:22:58,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 06:22:58,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 06:22:58,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 06:22:58,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 06:22:58,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 06:22:58,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 06:22:58,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 06:22:58,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 06:22:58,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 06:22:58,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 06:22:58,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 06:22:58,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 06:22:58,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 06:22:58,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 06:22:58,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 06:22:58,964 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 06:22:58,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 06:22:58,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 06:22:58,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 06:22:58,968 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 06:22:58,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 06:22:58,968 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 06:22:58,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 06:22:58,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 06:22:58,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 06:22:58,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 06:22:58,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 06:22:58,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 06:22:58,971 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 06:22:58,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 06:22:58,972 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 06:22:58,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 06:22:58,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 06:22:58,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 06:22:58,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 06:22:58,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 06:22:58,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 06:22:58,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 06:22:58,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 06:22:58,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 06:22:58,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 06:22:58,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 06:22:58,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 06:22:58,975 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 06:22:58,975 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 06:22:59,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 06:22:59,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 06:22:59,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 06:22:59,331 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 06:22:59,331 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 06:22:59,332 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-07-20 06:22:59,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a2c122e/99abf2f62347444a88645065dc1fb239/FLAG0ef701c88 [2020-07-20 06:22:59,911 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 06:22:59,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-07-20 06:22:59,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a2c122e/99abf2f62347444a88645065dc1fb239/FLAG0ef701c88 [2020-07-20 06:23:00,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a2c122e/99abf2f62347444a88645065dc1fb239 [2020-07-20 06:23:00,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 06:23:00,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 06:23:00,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 06:23:00,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 06:23:00,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 06:23:00,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:00" (1/1) ... [2020-07-20 06:23:00,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606f5cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00, skipping insertion in model container [2020-07-20 06:23:00,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:00" (1/1) ... [2020-07-20 06:23:00,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 06:23:00,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 06:23:00,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:23:00,546 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 06:23:00,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:23:00,703 INFO L208 MainTranslator]: Completed translation [2020-07-20 06:23:00,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00 WrapperNode [2020-07-20 06:23:00,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 06:23:00,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 06:23:00,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 06:23:00,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 06:23:00,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00" (1/1) ... [2020-07-20 06:23:00,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00" (1/1) ... [2020-07-20 06:23:00,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00" (1/1) ... [2020-07-20 06:23:00,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00" (1/1) ... [2020-07-20 06:23:00,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00" (1/1) ... [2020-07-20 06:23:00,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00" (1/1) ... [2020-07-20 06:23:00,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00" (1/1) ... [2020-07-20 06:23:00,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 06:23:00,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 06:23:00,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 06:23:00,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 06:23:00,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 06:23:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 06:23:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 06:23:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 06:23:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 06:23:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 06:23:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 06:23:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 06:23:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 06:23:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 06:23:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 06:23:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 06:23:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 06:23:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 06:23:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 06:23:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 06:23:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 06:23:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 06:23:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 06:23:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 06:23:00,823 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 06:23:00,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 06:23:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 06:23:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 06:23:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 06:23:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 06:23:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 06:23:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 06:23:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 06:23:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 06:23:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 06:23:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 06:23:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 06:23:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 06:23:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 06:23:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 06:23:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 06:23:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 06:23:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 06:23:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 06:23:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 06:23:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 06:23:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 06:23:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 06:23:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 06:23:01,289 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 06:23:01,290 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-20 06:23:01,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:23:01 BoogieIcfgContainer [2020-07-20 06:23:01,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 06:23:01,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 06:23:01,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 06:23:01,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 06:23:01,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:23:00" (1/3) ... [2020-07-20 06:23:01,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d78cfc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:23:01, skipping insertion in model container [2020-07-20 06:23:01,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:00" (2/3) ... [2020-07-20 06:23:01,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d78cfc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:23:01, skipping insertion in model container [2020-07-20 06:23:01,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:23:01" (3/3) ... [2020-07-20 06:23:01,308 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-07-20 06:23:01,319 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 06:23:01,326 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 06:23:01,338 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 06:23:01,366 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 06:23:01,366 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 06:23:01,367 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 06:23:01,367 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 06:23:01,367 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 06:23:01,368 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 06:23:01,368 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 06:23:01,368 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 06:23:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2020-07-20 06:23:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-20 06:23:01,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:01,405 INFO L422 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] [2020-07-20 06:23:01,406 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:01,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:01,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1024647557, now seen corresponding path program 1 times [2020-07-20 06:23:01,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:01,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676200370] [2020-07-20 06:23:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc8984 [2020-07-20 06:23:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:02,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676200370] [2020-07-20 06:23:02,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:02,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:23:02,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019251155] [2020-07-20 06:23:02,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:23:02,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:02,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:23:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:23:02,063 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 9 states. [2020-07-20 06:23:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:04,084 INFO L93 Difference]: Finished difference Result 479 states and 724 transitions. [2020-07-20 06:23:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 06:23:04,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-07-20 06:23:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:04,105 INFO L225 Difference]: With dead ends: 479 [2020-07-20 06:23:04,105 INFO L226 Difference]: Without dead ends: 340 [2020-07-20 06:23:04,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-20 06:23:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-07-20 06:23:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 233. [2020-07-20 06:23:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-07-20 06:23:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 300 transitions. [2020-07-20 06:23:04,233 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 300 transitions. Word has length 75 [2020-07-20 06:23:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:04,234 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 300 transitions. [2020-07-20 06:23:04,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:23:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 300 transitions. [2020-07-20 06:23:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-20 06:23:04,238 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:04,238 INFO L422 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] [2020-07-20 06:23:04,239 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 06:23:04,239 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1022106246, now seen corresponding path program 1 times [2020-07-20 06:23:04,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:04,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191407603] [2020-07-20 06:23:04,240 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc8984 [2020-07-20 06:23:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:04,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191407603] [2020-07-20 06:23:04,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:04,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:04,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854789203] [2020-07-20 06:23:04,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:04,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:04,519 INFO L87 Difference]: Start difference. First operand 233 states and 300 transitions. Second operand 10 states. [2020-07-20 06:23:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:05,533 INFO L93 Difference]: Finished difference Result 545 states and 744 transitions. [2020-07-20 06:23:05,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 06:23:05,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-07-20 06:23:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:05,539 INFO L225 Difference]: With dead ends: 545 [2020-07-20 06:23:05,540 INFO L226 Difference]: Without dead ends: 331 [2020-07-20 06:23:05,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-20 06:23:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-07-20 06:23:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 233. [2020-07-20 06:23:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-07-20 06:23:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 293 transitions. [2020-07-20 06:23:05,587 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 293 transitions. Word has length 75 [2020-07-20 06:23:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:05,588 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 293 transitions. [2020-07-20 06:23:05,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 293 transitions. [2020-07-20 06:23:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-20 06:23:05,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:05,590 INFO L422 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] [2020-07-20 06:23:05,591 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 06:23:05,591 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:05,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash -437656962, now seen corresponding path program 1 times [2020-07-20 06:23:05,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:05,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491912409] [2020-07-20 06:23:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc8984 [2020-07-20 06:23:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:05,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491912409] [2020-07-20 06:23:05,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:05,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:05,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791845620] [2020-07-20 06:23:05,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:05,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:05,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:05,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:05,842 INFO L87 Difference]: Start difference. First operand 233 states and 293 transitions. Second operand 10 states. [2020-07-20 06:23:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:07,176 INFO L93 Difference]: Finished difference Result 548 states and 738 transitions. [2020-07-20 06:23:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 06:23:07,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-07-20 06:23:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:07,185 INFO L225 Difference]: With dead ends: 548 [2020-07-20 06:23:07,186 INFO L226 Difference]: Without dead ends: 335 [2020-07-20 06:23:07,190 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-07-20 06:23:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-07-20 06:23:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 238. [2020-07-20 06:23:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-20 06:23:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 297 transitions. [2020-07-20 06:23:07,279 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 297 transitions. Word has length 75 [2020-07-20 06:23:07,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:07,282 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 297 transitions. [2020-07-20 06:23:07,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 297 transitions. [2020-07-20 06:23:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-20 06:23:07,290 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:07,291 INFO L422 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] [2020-07-20 06:23:07,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 06:23:07,291 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:07,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2011943168, now seen corresponding path program 1 times [2020-07-20 06:23:07,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:07,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552490972] [2020-07-20 06:23:07,294 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc8984 [2020-07-20 06:23:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:07,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552490972] [2020-07-20 06:23:07,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:07,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:23:07,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467530732] [2020-07-20 06:23:07,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:23:07,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:23:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:23:07,493 INFO L87 Difference]: Start difference. First operand 238 states and 297 transitions. Second operand 9 states. [2020-07-20 06:23:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:09,254 INFO L93 Difference]: Finished difference Result 848 states and 1162 transitions. [2020-07-20 06:23:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 06:23:09,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2020-07-20 06:23:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:09,263 INFO L225 Difference]: With dead ends: 848 [2020-07-20 06:23:09,264 INFO L226 Difference]: Without dead ends: 630 [2020-07-20 06:23:09,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2020-07-20 06:23:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-07-20 06:23:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 459. [2020-07-20 06:23:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-07-20 06:23:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 573 transitions. [2020-07-20 06:23:09,349 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 573 transitions. Word has length 75 [2020-07-20 06:23:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:09,350 INFO L479 AbstractCegarLoop]: Abstraction has 459 states and 573 transitions. [2020-07-20 06:23:09,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:23:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 573 transitions. [2020-07-20 06:23:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-20 06:23:09,355 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:09,356 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:23:09,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 06:23:09,362 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -3480132, now seen corresponding path program 1 times [2020-07-20 06:23:09,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:09,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084189060] [2020-07-20 06:23:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc8984 [2020-07-20 06:23:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 06:23:09,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084189060] [2020-07-20 06:23:09,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:09,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 06:23:09,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730362169] [2020-07-20 06:23:09,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 06:23:09,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:09,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 06:23:09,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:23:09,586 INFO L87 Difference]: Start difference. First operand 459 states and 573 transitions. Second operand 11 states. [2020-07-20 06:23:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:10,990 INFO L93 Difference]: Finished difference Result 1125 states and 1520 transitions. [2020-07-20 06:23:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 06:23:10,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-07-20 06:23:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:11,001 INFO L225 Difference]: With dead ends: 1125 [2020-07-20 06:23:11,001 INFO L226 Difference]: Without dead ends: 686 [2020-07-20 06:23:11,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2020-07-20 06:23:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-07-20 06:23:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 547. [2020-07-20 06:23:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-07-20 06:23:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 704 transitions. [2020-07-20 06:23:11,066 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 704 transitions. Word has length 93 [2020-07-20 06:23:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:11,067 INFO L479 AbstractCegarLoop]: Abstraction has 547 states and 704 transitions. [2020-07-20 06:23:11,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 06:23:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 704 transitions. [2020-07-20 06:23:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-20 06:23:11,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:11,069 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:23:11,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 06:23:11,070 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:11,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1935681914, now seen corresponding path program 1 times [2020-07-20 06:23:11,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:11,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592291162] [2020-07-20 06:23:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc8984 [2020-07-20 06:23:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 06:23:11,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592291162] [2020-07-20 06:23:11,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:11,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 06:23:11,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108004839] [2020-07-20 06:23:11,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 06:23:11,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:11,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 06:23:11,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:23:11,253 INFO L87 Difference]: Start difference. First operand 547 states and 704 transitions. Second operand 11 states. [2020-07-20 06:23:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:12,952 INFO L93 Difference]: Finished difference Result 1387 states and 1883 transitions. [2020-07-20 06:23:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-20 06:23:12,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-07-20 06:23:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:12,965 INFO L225 Difference]: With dead ends: 1387 [2020-07-20 06:23:12,966 INFO L226 Difference]: Without dead ends: 859 [2020-07-20 06:23:12,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2020-07-20 06:23:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-07-20 06:23:13,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 647. [2020-07-20 06:23:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-07-20 06:23:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 788 transitions. [2020-07-20 06:23:13,060 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 788 transitions. Word has length 93 [2020-07-20 06:23:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:13,061 INFO L479 AbstractCegarLoop]: Abstraction has 647 states and 788 transitions. [2020-07-20 06:23:13,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 06:23:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 788 transitions. [2020-07-20 06:23:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-20 06:23:13,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:13,064 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:23:13,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 06:23:13,064 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:13,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:13,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2111138888, now seen corresponding path program 1 times [2020-07-20 06:23:13,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:13,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994320954] [2020-07-20 06:23:13,066 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc8984 [2020-07-20 06:23:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 06:23:13,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994320954] [2020-07-20 06:23:13,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805439241] [2020-07-20 06:23:13,207 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@48174574 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:23:13,279 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@48174574 issued 1 check-sat command(s) [2020-07-20 06:23:13,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:23:13,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 06:23:13,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:23:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:13,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:23:13,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2020-07-20 06:23:13,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133912199] [2020-07-20 06:23:13,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:23:13,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:13,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:23:13,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:23:13,393 INFO L87 Difference]: Start difference. First operand 647 states and 788 transitions. Second operand 3 states. [2020-07-20 06:23:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:13,533 INFO L93 Difference]: Finished difference Result 1832 states and 2257 transitions. [2020-07-20 06:23:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:23:13,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-07-20 06:23:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:13,542 INFO L225 Difference]: With dead ends: 1832 [2020-07-20 06:23:13,542 INFO L226 Difference]: Without dead ends: 932 [2020-07-20 06:23:13,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:23:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2020-07-20 06:23:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 868. [2020-07-20 06:23:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2020-07-20 06:23:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1025 transitions. [2020-07-20 06:23:13,640 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1025 transitions. Word has length 93 [2020-07-20 06:23:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:13,640 INFO L479 AbstractCegarLoop]: Abstraction has 868 states and 1025 transitions. [2020-07-20 06:23:13,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:23:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1025 transitions. [2020-07-20 06:23:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-07-20 06:23:13,642 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:13,643 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:23:13,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-20 06:23:13,858 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash 785362142, now seen corresponding path program 1 times [2020-07-20 06:23:13,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:13,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845600260] [2020-07-20 06:23:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc8984 [2020-07-20 06:23:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-20 06:23:14,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845600260] [2020-07-20 06:23:14,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001989903] [2020-07-20 06:23:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@254f9f0e No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:23:14,077 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@254f9f0e issued 1 check-sat command(s) [2020-07-20 06:23:14,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:23:14,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 06:23:14,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:23:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:14,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:23:14,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-20 06:23:14,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326391472] [2020-07-20 06:23:14,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:23:14,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:14,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:23:14,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:14,122 INFO L87 Difference]: Start difference. First operand 868 states and 1025 transitions. Second operand 3 states. [2020-07-20 06:23:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:14,266 INFO L93 Difference]: Finished difference Result 2320 states and 2806 transitions. [2020-07-20 06:23:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:23:14,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2020-07-20 06:23:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:14,279 INFO L225 Difference]: With dead ends: 2320 [2020-07-20 06:23:14,280 INFO L226 Difference]: Without dead ends: 1473 [2020-07-20 06:23:14,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-07-20 06:23:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1400. [2020-07-20 06:23:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2020-07-20 06:23:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1657 transitions. [2020-07-20 06:23:14,477 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1657 transitions. Word has length 128 [2020-07-20 06:23:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:14,477 INFO L479 AbstractCegarLoop]: Abstraction has 1400 states and 1657 transitions. [2020-07-20 06:23:14,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:23:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1657 transitions. [2020-07-20 06:23:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-07-20 06:23:14,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:14,481 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:23:14,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:23:14,695 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash 473506967, now seen corresponding path program 1 times [2020-07-20 06:23:14,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:14,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45067489] [2020-07-20 06:23:14,696 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcc8984 [2020-07-20 06:23:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 06:23:14,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 06:23:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 06:23:14,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 06:23:14,776 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 06:23:14,776 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 06:23:14,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 06:23:14,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:23:14 BoogieIcfgContainer [2020-07-20 06:23:14,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 06:23:14,919 INFO L168 Benchmark]: Toolchain (without parser) took 14665.61 ms. Allocated memory was 138.9 MB in the beginning and 405.3 MB in the end (delta: 266.3 MB). Free memory was 103.8 MB in the beginning and 326.2 MB in the end (delta: -222.4 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:14,920 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-20 06:23:14,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.56 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.3 MB in the beginning and 182.4 MB in the end (delta: -79.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:14,922 INFO L168 Benchmark]: Boogie Preprocessor took 44.34 ms. Allocated memory is still 203.4 MB. Free memory was 182.4 MB in the beginning and 180.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:14,923 INFO L168 Benchmark]: RCFGBuilder took 544.49 ms. Allocated memory is still 203.4 MB. Free memory was 180.0 MB in the beginning and 150.1 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:14,923 INFO L168 Benchmark]: TraceAbstraction took 13616.34 ms. Allocated memory was 203.4 MB in the beginning and 405.3 MB in the end (delta: 201.9 MB). Free memory was 150.1 MB in the beginning and 326.2 MB in the end (delta: -176.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:14,927 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 449.56 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.3 MB in the beginning and 182.4 MB in the end (delta: -79.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.34 ms. Allocated memory is still 203.4 MB. Free memory was 182.4 MB in the beginning and 180.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 544.49 ms. Allocated memory is still 203.4 MB. Free memory was 180.0 MB in the beginning and 150.1 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13616.34 ms. Allocated memory was 203.4 MB in the beginning and 405.3 MB in the end (delta: 201.9 MB). Free memory was 150.1 MB in the beginning and 326.2 MB in the end (delta: -176.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [\old(E_1)=6, \old(M_E)=11, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=10, \old(t1_pc)=7, \old(t1_st)=4, E_1=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] [L439] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L443] CALL init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L354] m_i = 1 [L355] t1_i = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L443] RET init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L444] CALL start_simulation() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L387] FCALL update_channels() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L388] CALL init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L388] RET init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L240] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L245] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L250] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L389] RET fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L390] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=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] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=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] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=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] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L124] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L134] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=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] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=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] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=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, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=0, tmp___0=0] [L390] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L263] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L268] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L273] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L391] RET reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L394] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L397] kernel_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=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] [L398] CALL eval() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L187] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=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] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=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] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1, tmp_ndt_1=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=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] [L72] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=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] [L83] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=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] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=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] [L221] RET transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=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] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=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] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1] [L207] CALL master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=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] [L31] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=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] [L42] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=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] [L45] E_1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L46] CALL immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L312] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L46] RET immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=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] [L50] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=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] [L52] m_pc = 1 [L53] m_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=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] [L207] RET master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=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, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=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] [L72] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=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] [L75] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=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] [L91] CALL error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=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] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.4s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1346 SDtfs, 3574 SDslu, 717 SDs, 0 SdLazy, 5735 SolverSat, 1974 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1400occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 961 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 892 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 918 ConstructedInterpolants, 0 QuantifiedInterpolants, 167785 SizeOfPredicates, 1 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 118/124 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! Received shutdown request...