/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:59:24,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:59:24,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:59:24,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:59:24,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:59:24,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:59:24,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:59:24,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:59:24,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:59:24,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:59:24,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:59:24,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:59:24,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:59:24,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:59:24,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:59:24,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:59:24,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:59:24,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:59:24,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:59:24,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:59:24,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:59:24,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:59:24,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:59:24,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:59:24,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:59:24,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:59:24,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:59:24,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:59:24,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:59:24,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:59:24,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:59:24,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:59:24,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:59:24,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:59:24,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:59:24,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:59:24,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:59:24,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:59:24,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:59:24,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:59:24,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:59:24,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 22:59:24,551 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:59:24,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:59:24,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:59:24,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:59:24,558 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:59:24,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:59:24,558 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:59:24,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:59:24,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:59:24,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:59:24,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:59:24,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:59:24,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:59:24,559 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:59:24,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:59:24,560 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:59:24,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:59:24,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:59:24,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:59:24,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:59:24,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:59:24,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:59:24,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:59:24,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 22:59:24,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:59:24,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:59:24,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:59:24,564 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 22:59:24,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:59:24,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:59:24,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:59:24,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:59:24,908 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:59:24,908 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:59:24,909 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2020-10-21 22:59:24,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8961d1d9/d7ea7b196d634c04b1416ef18e9f673d/FLAGf761aeb3e [2020-10-21 22:59:25,592 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:59:25,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2020-10-21 22:59:25,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8961d1d9/d7ea7b196d634c04b1416ef18e9f673d/FLAGf761aeb3e [2020-10-21 22:59:25,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8961d1d9/d7ea7b196d634c04b1416ef18e9f673d [2020-10-21 22:59:25,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:59:25,836 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:59:25,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:59:25,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:59:25,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:59:25,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e7e8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:25, skipping insertion in model container [2020-10-21 22:59:25,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:59:25" (1/1) ... [2020-10-21 22:59:25,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:59:25,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:59:26,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:59:26,582 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:59:26,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:59:26,713 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:59:26,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26 WrapperNode [2020-10-21 22:59:26,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:59:26,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:59:26,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:59:26,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:59:26,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (1/1) ... [2020-10-21 22:59:26,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (1/1) ... [2020-10-21 22:59:26,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:59:26,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:59:26,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:59:26,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:59:26,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (1/1) ... [2020-10-21 22:59:26,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (1/1) ... [2020-10-21 22:59:26,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (1/1) ... [2020-10-21 22:59:26,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (1/1) ... [2020-10-21 22:59:26,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (1/1) ... [2020-10-21 22:59:26,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (1/1) ... [2020-10-21 22:59:26,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (1/1) ... [2020-10-21 22:59:26,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:59:26,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:59:26,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:59:26,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:59:26,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (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-10-21 22:59:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:59:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:59:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:59:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:59:26,916 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:59:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:59:26,916 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:59:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:59:26,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:59:26,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:59:26,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:59:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:59:26,920 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:59:28,866 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:59:28,866 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:59:28,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:59:28 BoogieIcfgContainer [2020-10-21 22:59:28,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:59:28,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:59:28,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:59:28,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:59:28,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:59:25" (1/3) ... [2020-10-21 22:59:28,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c2958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:59:28, skipping insertion in model container [2020-10-21 22:59:28,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:26" (2/3) ... [2020-10-21 22:59:28,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c2958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:59:28, skipping insertion in model container [2020-10-21 22:59:28,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:59:28" (3/3) ... [2020-10-21 22:59:28,877 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt.i [2020-10-21 22:59:28,889 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:59:28,889 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:59:28,896 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:59:28,897 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:59:28,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,925 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,925 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,929 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,937 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,938 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,943 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:28,947 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:59:28,961 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-21 22:59:28,983 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:59:28,983 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:59:28,983 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 22:59:28,983 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:59:28,984 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:59:28,984 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:59:28,984 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:59:28,984 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:59:28,998 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 22:59:28,999 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 88 transitions, 186 flow [2020-10-21 22:59:29,002 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 88 transitions, 186 flow [2020-10-21 22:59:29,004 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 92 places, 88 transitions, 186 flow [2020-10-21 22:59:29,046 INFO L129 PetriNetUnfolder]: 3/86 cut-off events. [2020-10-21 22:59:29,046 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:59:29,051 INFO L80 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 3/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2020-10-21 22:59:29,053 INFO L116 LiptonReduction]: Number of co-enabled transitions 1182 [2020-10-21 22:59:29,423 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 22:59:29,585 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 22:59:29,745 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-21 22:59:30,803 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 22:59:30,924 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 22:59:33,059 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-21 22:59:33,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-21 22:59:33,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:33,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:59:33,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:33,918 WARN L193 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-21 22:59:35,222 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2020-10-21 22:59:35,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 22:59:35,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:35,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:59:35,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:36,272 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 145 DAG size of output: 109 [2020-10-21 22:59:37,310 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 136 DAG size of output: 127 [2020-10-21 22:59:37,689 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-21 22:59:37,826 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-21 22:59:37,952 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-21 22:59:38,342 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-10-21 22:59:38,505 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-21 22:59:38,525 INFO L131 LiptonReduction]: Checked pairs total: 3208 [2020-10-21 22:59:38,525 INFO L133 LiptonReduction]: Total number of compositions: 87 [2020-10-21 22:59:38,541 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 50 flow [2020-10-21 22:59:38,565 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 187 states. [2020-10-21 22:59:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2020-10-21 22:59:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 22:59:38,574 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:38,575 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 22:59:38,575 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash 926823553, now seen corresponding path program 1 times [2020-10-21 22:59:38,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:38,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902061461] [2020-10-21 22:59:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:38,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902061461] [2020-10-21 22:59:38,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:38,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:59:38,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966839727] [2020-10-21 22:59:38,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:59:38,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:38,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:59:38,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:59:38,830 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 3 states. [2020-10-21 22:59:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:38,909 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2020-10-21 22:59:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:59:38,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 22:59:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:38,924 INFO L225 Difference]: With dead ends: 162 [2020-10-21 22:59:38,924 INFO L226 Difference]: Without dead ends: 132 [2020-10-21 22:59:38,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:59:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-21 22:59:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-21 22:59:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-21 22:59:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions. [2020-10-21 22:59:38,978 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 5 [2020-10-21 22:59:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:38,979 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 306 transitions. [2020-10-21 22:59:38,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:59:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions. [2020-10-21 22:59:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 22:59:38,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:38,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:38,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:59:38,981 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1619268401, now seen corresponding path program 1 times [2020-10-21 22:59:38,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:38,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374730747] [2020-10-21 22:59:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:39,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374730747] [2020-10-21 22:59:39,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:39,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:59:39,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149381200] [2020-10-21 22:59:39,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:59:39,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:39,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:59:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:59:39,082 INFO L87 Difference]: Start difference. First operand 132 states and 306 transitions. Second operand 3 states. [2020-10-21 22:59:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,099 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2020-10-21 22:59:39,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:59:39,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 22:59:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,103 INFO L225 Difference]: With dead ends: 122 [2020-10-21 22:59:39,103 INFO L226 Difference]: Without dead ends: 122 [2020-10-21 22:59:39,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:59:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-21 22:59:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-21 22:59:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-21 22:59:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2020-10-21 22:59:39,117 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 7 [2020-10-21 22:59:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,118 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2020-10-21 22:59:39,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:59:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2020-10-21 22:59:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 22:59:39,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:59:39,120 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1303932898, now seen corresponding path program 1 times [2020-10-21 22:59:39,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428266176] [2020-10-21 22:59:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:39,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428266176] [2020-10-21 22:59:39,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:39,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:59:39,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549397006] [2020-10-21 22:59:39,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:59:39,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:59:39,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:59:39,264 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand 5 states. [2020-10-21 22:59:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,309 INFO L93 Difference]: Finished difference Result 118 states and 266 transitions. [2020-10-21 22:59:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:59:39,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-21 22:59:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,312 INFO L225 Difference]: With dead ends: 118 [2020-10-21 22:59:39,312 INFO L226 Difference]: Without dead ends: 118 [2020-10-21 22:59:39,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:59:39,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-21 22:59:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-10-21 22:59:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-21 22:59:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 266 transitions. [2020-10-21 22:59:39,323 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 266 transitions. Word has length 9 [2020-10-21 22:59:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,323 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 266 transitions. [2020-10-21 22:59:39,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:59:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 266 transitions. [2020-10-21 22:59:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:59:39,325 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:59:39,326 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2002665435, now seen corresponding path program 1 times [2020-10-21 22:59:39,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091802422] [2020-10-21 22:59:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:39,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091802422] [2020-10-21 22:59:39,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:39,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:59:39,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58372742] [2020-10-21 22:59:39,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:59:39,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:39,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:59:39,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:39,492 INFO L87 Difference]: Start difference. First operand 118 states and 266 transitions. Second operand 6 states. [2020-10-21 22:59:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,628 INFO L93 Difference]: Finished difference Result 128 states and 292 transitions. [2020-10-21 22:59:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:59:39,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 22:59:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,633 INFO L225 Difference]: With dead ends: 128 [2020-10-21 22:59:39,633 INFO L226 Difference]: Without dead ends: 128 [2020-10-21 22:59:39,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-21 22:59:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-10-21 22:59:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-21 22:59:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 292 transitions. [2020-10-21 22:59:39,644 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 292 transitions. Word has length 11 [2020-10-21 22:59:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,645 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 292 transitions. [2020-10-21 22:59:39,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:59:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 292 transitions. [2020-10-21 22:59:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:59:39,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:59:39,647 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1967867625, now seen corresponding path program 2 times [2020-10-21 22:59:39,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555181969] [2020-10-21 22:59:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:39,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555181969] [2020-10-21 22:59:39,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:39,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:59:39,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438225599] [2020-10-21 22:59:39,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:59:39,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:39,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:59:39,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:39,784 INFO L87 Difference]: Start difference. First operand 128 states and 292 transitions. Second operand 6 states. [2020-10-21 22:59:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:39,869 INFO L93 Difference]: Finished difference Result 131 states and 298 transitions. [2020-10-21 22:59:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:59:39,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 22:59:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:39,872 INFO L225 Difference]: With dead ends: 131 [2020-10-21 22:59:39,872 INFO L226 Difference]: Without dead ends: 131 [2020-10-21 22:59:39,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-21 22:59:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2020-10-21 22:59:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-21 22:59:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 290 transitions. [2020-10-21 22:59:39,881 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 290 transitions. Word has length 11 [2020-10-21 22:59:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:39,881 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 290 transitions. [2020-10-21 22:59:39,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:59:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 290 transitions. [2020-10-21 22:59:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:59:39,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:39,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:39,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:59:39,884 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:39,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:39,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1348825587, now seen corresponding path program 3 times [2020-10-21 22:59:39,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:39,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350778174] [2020-10-21 22:59:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:40,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350778174] [2020-10-21 22:59:40,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:40,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:59:40,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865822829] [2020-10-21 22:59:40,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:59:40,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:59:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:40,086 INFO L87 Difference]: Start difference. First operand 127 states and 290 transitions. Second operand 6 states. [2020-10-21 22:59:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:40,219 INFO L93 Difference]: Finished difference Result 133 states and 300 transitions. [2020-10-21 22:59:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:59:40,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 22:59:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:40,221 INFO L225 Difference]: With dead ends: 133 [2020-10-21 22:59:40,222 INFO L226 Difference]: Without dead ends: 133 [2020-10-21 22:59:40,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-21 22:59:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-21 22:59:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2020-10-21 22:59:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-21 22:59:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 273 transitions. [2020-10-21 22:59:40,229 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 273 transitions. Word has length 11 [2020-10-21 22:59:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:40,230 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 273 transitions. [2020-10-21 22:59:40,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:59:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 273 transitions. [2020-10-21 22:59:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:59:40,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:40,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:40,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:59:40,232 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1050992703, now seen corresponding path program 1 times [2020-10-21 22:59:40,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:40,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496750836] [2020-10-21 22:59:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:40,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496750836] [2020-10-21 22:59:40,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:40,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:59:40,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628161433] [2020-10-21 22:59:40,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:59:40,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:59:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:59:40,339 INFO L87 Difference]: Start difference. First operand 122 states and 273 transitions. Second operand 4 states. [2020-10-21 22:59:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:40,370 INFO L93 Difference]: Finished difference Result 106 states and 202 transitions. [2020-10-21 22:59:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:59:40,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 22:59:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:40,371 INFO L225 Difference]: With dead ends: 106 [2020-10-21 22:59:40,371 INFO L226 Difference]: Without dead ends: 74 [2020-10-21 22:59:40,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:59:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-21 22:59:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-21 22:59:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-21 22:59:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 129 transitions. [2020-10-21 22:59:40,376 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 129 transitions. Word has length 11 [2020-10-21 22:59:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:40,376 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 129 transitions. [2020-10-21 22:59:40,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:59:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 129 transitions. [2020-10-21 22:59:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:59:40,377 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:40,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:40,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:59:40,378 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:40,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1546414654, now seen corresponding path program 1 times [2020-10-21 22:59:40,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:40,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035190569] [2020-10-21 22:59:40,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:40,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035190569] [2020-10-21 22:59:40,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:40,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:59:40,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397051097] [2020-10-21 22:59:40,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:59:40,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:40,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:59:40,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:59:40,455 INFO L87 Difference]: Start difference. First operand 74 states and 129 transitions. Second operand 5 states. [2020-10-21 22:59:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:40,496 INFO L93 Difference]: Finished difference Result 58 states and 95 transitions. [2020-10-21 22:59:40,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:59:40,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 22:59:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:40,498 INFO L225 Difference]: With dead ends: 58 [2020-10-21 22:59:40,498 INFO L226 Difference]: Without dead ends: 47 [2020-10-21 22:59:40,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:59:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-21 22:59:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-10-21 22:59:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-21 22:59:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2020-10-21 22:59:40,502 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 12 [2020-10-21 22:59:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:40,502 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2020-10-21 22:59:40,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:59:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2020-10-21 22:59:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:59:40,503 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:40,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:40,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:59:40,504 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:40,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:40,504 INFO L82 PathProgramCache]: Analyzing trace with hash 258980126, now seen corresponding path program 1 times [2020-10-21 22:59:40,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:40,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309378051] [2020-10-21 22:59:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:40,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309378051] [2020-10-21 22:59:40,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:40,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:59:40,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935046789] [2020-10-21 22:59:40,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:59:40,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:40,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:59:40,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:59:40,558 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 4 states. [2020-10-21 22:59:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:40,579 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2020-10-21 22:59:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:59:40,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-21 22:59:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:40,581 INFO L225 Difference]: With dead ends: 59 [2020-10-21 22:59:40,581 INFO L226 Difference]: Without dead ends: 25 [2020-10-21 22:59:40,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:59:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-21 22:59:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-21 22:59:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-21 22:59:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-21 22:59:40,583 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-10-21 22:59:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:40,584 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-21 22:59:40,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:59:40,584 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-10-21 22:59:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:59:40,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:40,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:40,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:59:40,585 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash 598532766, now seen corresponding path program 2 times [2020-10-21 22:59:40,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:40,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882598755] [2020-10-21 22:59:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:59:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:59:40,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882598755] [2020-10-21 22:59:40,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:59:40,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:59:40,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602597700] [2020-10-21 22:59:40,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:59:40,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:59:40,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:59:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:59:40,728 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 7 states. [2020-10-21 22:59:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:59:40,847 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2020-10-21 22:59:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:59:40,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-21 22:59:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:59:40,849 INFO L225 Difference]: With dead ends: 33 [2020-10-21 22:59:40,849 INFO L226 Difference]: Without dead ends: 21 [2020-10-21 22:59:40,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:59:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-21 22:59:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-21 22:59:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-21 22:59:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-21 22:59:40,851 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-21 22:59:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:59:40,852 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-21 22:59:40,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:59:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-21 22:59:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:59:40,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:59:40,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:59:40,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:59:40,854 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:59:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:59:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1247248418, now seen corresponding path program 3 times [2020-10-21 22:59:40,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:59:40,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805147893] [2020-10-21 22:59:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:59:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:59:40,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:59:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:59:40,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:59:40,966 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:59:40,966 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:59:40,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:59:40,968 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:59:40,978 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L809-->L816: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In-538510239 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In-538510239 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In-538510239 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In-538510239 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse8 .cse9)) (.cse0 (or .cse7 .cse6)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~x$r_buff0_thd0~0_Out-538510239 ~x$r_buff0_thd0~0_In-538510239) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-538510239 0)) (or (and .cse0 (= ~x$w_buff1_used~0_In-538510239 ~x$w_buff1_used~0_Out-538510239)) (and .cse1 (= ~x$w_buff1_used~0_Out-538510239 0) .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-538510239 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-538510239|) (or (and .cse3 (= ~x$w_buff0_used~0_In-538510239 ~x$w_buff0_used~0_Out-538510239)) (and .cse4 (= 0 ~x$w_buff0_used~0_Out-538510239) .cse5)) (= ~x$r_buff1_thd0~0_Out-538510239 ~x$r_buff1_thd0~0_In-538510239) (or (and .cse4 .cse5 (= ~x$w_buff0~0_In-538510239 ~x~0_Out-538510239)) (and .cse3 (or (and .cse0 (= ~x~0_In-538510239 ~x~0_Out-538510239)) (and .cse1 (= ~x$w_buff1~0_In-538510239 ~x~0_Out-538510239) .cse2))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-538510239, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-538510239, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-538510239|, ~x$w_buff1~0=~x$w_buff1~0_In-538510239, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-538510239, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-538510239, ~x~0=~x~0_In-538510239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-538510239} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-538510239, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-538510239, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-538510239|, ~x$w_buff1~0=~x$w_buff1~0_In-538510239, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-538510239|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-538510239, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-538510239, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-538510239|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-538510239|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-538510239|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-538510239, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-538510239|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-538510239|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-538510239, ~x~0=~x~0_Out-538510239} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-21 22:59:40,984 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,985 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,985 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,985 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [759] [2020-10-21 22:59:40,987 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,987 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,988 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,988 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,988 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,989 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,989 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,990 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,990 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,991 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,991 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,991 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,992 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,992 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,993 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,993 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,994 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,994 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,994 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,995 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,995 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,996 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,996 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:40,996 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:59:40,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:59:41,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:59:41 BasicIcfg [2020-10-21 22:59:41,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:59:41,053 INFO L168 Benchmark]: Toolchain (without parser) took 15221.98 ms. Allocated memory was 143.7 MB in the beginning and 391.6 MB in the end (delta: 248.0 MB). Free memory was 98.0 MB in the beginning and 173.8 MB in the end (delta: -75.8 MB). Peak memory consumption was 172.2 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:41,054 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.7 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 22:59:41,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.94 ms. Allocated memory was 143.7 MB in the beginning and 199.8 MB in the end (delta: 56.1 MB). Free memory was 96.9 MB in the beginning and 150.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:41,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.01 ms. Allocated memory is still 199.8 MB. Free memory was 150.2 MB in the beginning and 147.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:41,057 INFO L168 Benchmark]: Boogie Preprocessor took 39.29 ms. Allocated memory is still 199.8 MB. Free memory was 147.4 MB in the beginning and 145.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:41,058 INFO L168 Benchmark]: RCFGBuilder took 2034.89 ms. Allocated memory was 199.8 MB in the beginning and 254.3 MB in the end (delta: 54.5 MB). Free memory was 144.5 MB in the beginning and 202.6 MB in the end (delta: -58.1 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:41,062 INFO L168 Benchmark]: TraceAbstraction took 12180.73 ms. Allocated memory was 254.3 MB in the beginning and 391.6 MB in the end (delta: 137.4 MB). Free memory was 202.6 MB in the beginning and 173.8 MB in the end (delta: 28.8 MB). Peak memory consumption was 166.2 MB. Max. memory is 7.1 GB. [2020-10-21 22:59:41,075 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 143.7 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 872.94 ms. Allocated memory was 143.7 MB in the beginning and 199.8 MB in the end (delta: 56.1 MB). Free memory was 96.9 MB in the beginning and 150.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.01 ms. Allocated memory is still 199.8 MB. Free memory was 150.2 MB in the beginning and 147.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.29 ms. Allocated memory is still 199.8 MB. Free memory was 147.4 MB in the beginning and 145.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2034.89 ms. Allocated memory was 199.8 MB in the beginning and 254.3 MB in the end (delta: 54.5 MB). Free memory was 144.5 MB in the beginning and 202.6 MB in the end (delta: -58.1 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12180.73 ms. Allocated memory was 254.3 MB in the beginning and 391.6 MB in the end (delta: 137.4 MB). Free memory was 202.6 MB in the beginning and 173.8 MB in the end (delta: 28.8 MB). Peak memory consumption was 166.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 659 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 42 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.5s, 92 PlacesBefore, 27 PlacesAfterwards, 88 TransitionsBefore, 20 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, 3208 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1103; [L803] FCALL, FORK 0 pthread_create(&t1103, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1104; [L805] FCALL, FORK 0 pthread_create(&t1104, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L18] COND TRUE 2 !expression [L17] COND FALSE 2 !(0) [L17] 2 __assert_fail ("0", "mix041_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L824] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix041_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 86 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 173 SDtfs, 147 SDslu, 235 SDs, 0 SdLazy, 190 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 8187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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...