/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:18:30,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:18:30,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:18:30,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:18:30,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:18:30,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:18:30,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:18:30,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:18:30,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:18:30,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:18:30,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:18:30,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:18:30,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:18:30,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:18:30,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:18:30,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:18:30,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:18:30,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:18:30,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:18:30,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:18:30,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:18:30,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:18:30,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:18:30,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:18:30,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:18:30,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:18:30,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:18:30,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:18:30,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:18:30,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:18:30,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:18:30,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:18:30,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:18:30,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:18:30,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:18:30,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:18:30,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:18:30,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:18:30,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:18:30,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:18:30,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:18:30,798 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:18:30,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:18:30,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:18:30,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:18:30,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:18:30,819 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:18:30,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:18:30,820 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:18:30,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:18:30,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:18:30,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:18:30,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:18:30,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:18:30,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:18:30,822 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:18:30,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:18:30,823 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:18:30,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:18:30,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:18:30,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:18:30,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:18:30,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:18:30,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:18:30,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:18:30,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:18:30,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:18:30,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:18:30,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:18:30,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:18:30,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:18:31,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:18:31,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:18:31,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:18:31,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:18:31,107 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:18:31,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_rmo.opt.i [2019-12-27 02:18:31,183 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae40c4ee/ed01c8b16d2e4a5f8f790f73746986ea/FLAG1ff08640a [2019-12-27 02:18:31,785 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:18:31,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_rmo.opt.i [2019-12-27 02:18:31,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae40c4ee/ed01c8b16d2e4a5f8f790f73746986ea/FLAG1ff08640a [2019-12-27 02:18:32,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae40c4ee/ed01c8b16d2e4a5f8f790f73746986ea [2019-12-27 02:18:32,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:18:32,040 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:18:32,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:18:32,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:18:32,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:18:32,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b48939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32, skipping insertion in model container [2019-12-27 02:18:32,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:18:32,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:18:32,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:18:32,665 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:18:32,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:18:32,825 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:18:32,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32 WrapperNode [2019-12-27 02:18:32,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:18:32,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:18:32,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:18:32,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:18:32,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:18:32,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:18:32,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:18:32,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:18:32,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (1/1) ... [2019-12-27 02:18:32,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:18:32,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:18:32,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:18:32,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:18:32,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (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 [2019-12-27 02:18:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:18:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:18:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:18:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:18:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:18:33,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:18:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:18:33,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:18:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:18:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:18:33,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:18:33,010 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:18:33,711 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:18:33,711 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:18:33,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:18:33 BoogieIcfgContainer [2019-12-27 02:18:33,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:18:33,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:18:33,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:18:33,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:18:33,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:18:32" (1/3) ... [2019-12-27 02:18:33,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc07db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:18:33, skipping insertion in model container [2019-12-27 02:18:33,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:32" (2/3) ... [2019-12-27 02:18:33,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc07db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:18:33, skipping insertion in model container [2019-12-27 02:18:33,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:18:33" (3/3) ... [2019-12-27 02:18:33,726 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_rmo.opt.i [2019-12-27 02:18:33,737 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:18:33,737 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:18:33,750 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:18:33,751 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:18:33,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,809 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,809 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,810 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,810 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,820 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,875 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,876 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,876 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,883 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:33,902 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:18:33,923 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:18:33,923 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:18:33,924 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:18:33,924 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:18:33,924 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:18:33,924 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:18:33,924 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:18:33,924 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:18:33,941 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-27 02:18:33,944 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 02:18:34,034 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 02:18:34,035 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:18:34,051 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:18:34,070 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 02:18:34,115 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 02:18:34,115 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:18:34,121 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:18:34,135 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 02:18:34,136 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:18:39,095 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 02:18:39,211 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 02:18:39,460 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-27 02:18:39,461 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 02:18:39,464 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 02:18:40,055 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-27 02:18:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-27 02:18:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:18:40,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:40,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:18:40,067 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:40,073 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-27 02:18:40,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:40,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003964909] [2019-12-27 02:18:40,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:40,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003964909] [2019-12-27 02:18:40,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:40,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:18:40,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089632146] [2019-12-27 02:18:40,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:40,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:40,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:40,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:40,383 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-27 02:18:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:40,645 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-27 02:18:40,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:40,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:18:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:40,794 INFO L225 Difference]: With dead ends: 8598 [2019-12-27 02:18:40,794 INFO L226 Difference]: Without dead ends: 7662 [2019-12-27 02:18:40,796 INFO L631 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 [2019-12-27 02:18:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-27 02:18:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-27 02:18:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-27 02:18:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-27 02:18:41,262 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-27 02:18:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:41,263 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-27 02:18:41,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-27 02:18:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:18:41,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:41,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:41,270 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:41,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-27 02:18:41,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:41,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817058157] [2019-12-27 02:18:41,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:41,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817058157] [2019-12-27 02:18:41,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:41,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:41,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307685234] [2019-12-27 02:18:41,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:41,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:41,377 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-27 02:18:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:41,420 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-27 02:18:41,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:41,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 02:18:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:41,430 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 02:18:41,430 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 02:18:41,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 02:18:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 02:18:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 02:18:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-27 02:18:41,483 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-27 02:18:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:41,483 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-27 02:18:41,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-27 02:18:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:18:41,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:41,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:41,494 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-27 02:18:41,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:41,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710425473] [2019-12-27 02:18:41,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:41,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710425473] [2019-12-27 02:18:41,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:41,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:41,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772894304] [2019-12-27 02:18:41,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:41,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:41,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:41,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:41,612 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-27 02:18:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:41,749 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-27 02:18:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:41,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 02:18:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:41,760 INFO L225 Difference]: With dead ends: 1943 [2019-12-27 02:18:41,760 INFO L226 Difference]: Without dead ends: 1943 [2019-12-27 02:18:41,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-27 02:18:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-27 02:18:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-27 02:18:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-27 02:18:41,814 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-27 02:18:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:41,816 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-27 02:18:41,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-27 02:18:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:18:41,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:41,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:41,820 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:41,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-27 02:18:41,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:41,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5516745] [2019-12-27 02:18:41,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:41,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5516745] [2019-12-27 02:18:41,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:41,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:41,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143371777] [2019-12-27 02:18:41,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:41,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:41,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:41,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:41,972 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-27 02:18:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:42,188 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-27 02:18:42,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:18:42,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:18:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:42,199 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 02:18:42,199 INFO L226 Difference]: Without dead ends: 1724 [2019-12-27 02:18:42,200 INFO L631 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 [2019-12-27 02:18:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-27 02:18:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-27 02:18:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-27 02:18:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-27 02:18:42,254 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-27 02:18:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:42,254 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-27 02:18:42,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-27 02:18:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:18:42,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:42,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:42,256 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:42,256 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-27 02:18:42,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:42,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517607624] [2019-12-27 02:18:42,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:42,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517607624] [2019-12-27 02:18:42,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:42,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:42,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649226881] [2019-12-27 02:18:42,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:42,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:42,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:42,308 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-27 02:18:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:42,486 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-27 02:18:42,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:18:42,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:18:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:42,497 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 02:18:42,497 INFO L226 Difference]: Without dead ends: 1991 [2019-12-27 02:18:42,498 INFO L631 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 [2019-12-27 02:18:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-27 02:18:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-27 02:18:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-27 02:18:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-27 02:18:42,539 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-27 02:18:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:42,540 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-27 02:18:42,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-27 02:18:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:18:42,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:42,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:42,543 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:42,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-27 02:18:42,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:42,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37433998] [2019-12-27 02:18:42,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:42,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37433998] [2019-12-27 02:18:42,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:42,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:42,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134554733] [2019-12-27 02:18:42,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:18:42,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:42,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:18:42,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:42,647 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-27 02:18:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:42,919 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-27 02:18:42,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:18:42,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 02:18:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:42,943 INFO L225 Difference]: With dead ends: 2258 [2019-12-27 02:18:42,944 INFO L226 Difference]: Without dead ends: 2258 [2019-12-27 02:18:42,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:18:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-27 02:18:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-27 02:18:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-27 02:18:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-27 02:18:43,006 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-27 02:18:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:43,006 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-27 02:18:43,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:18:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-27 02:18:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:18:43,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:43,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:43,010 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:43,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-27 02:18:43,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:43,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022845750] [2019-12-27 02:18:43,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:43,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022845750] [2019-12-27 02:18:43,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:43,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:18:43,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357152949] [2019-12-27 02:18:43,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:43,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:43,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:43,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:43,095 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-27 02:18:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:43,108 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-27 02:18:43,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:43,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 02:18:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:43,123 INFO L225 Difference]: With dead ends: 2001 [2019-12-27 02:18:43,123 INFO L226 Difference]: Without dead ends: 2001 [2019-12-27 02:18:43,123 INFO L631 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 [2019-12-27 02:18:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-27 02:18:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-27 02:18:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-27 02:18:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-27 02:18:43,189 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-27 02:18:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:43,189 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-27 02:18:43,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-27 02:18:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:18:43,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:43,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:43,192 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-27 02:18:43,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:43,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654225181] [2019-12-27 02:18:43,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:43,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654225181] [2019-12-27 02:18:43,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:43,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:18:43,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340255860] [2019-12-27 02:18:43,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:18:43,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:43,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:18:43,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:43,349 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-27 02:18:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:43,416 INFO L93 Difference]: Finished difference Result 2103 states and 4690 transitions. [2019-12-27 02:18:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:18:43,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 02:18:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:43,469 INFO L225 Difference]: With dead ends: 2103 [2019-12-27 02:18:43,469 INFO L226 Difference]: Without dead ends: 2103 [2019-12-27 02:18:43,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-12-27 02:18:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2103. [2019-12-27 02:18:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2103 states. [2019-12-27 02:18:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 4690 transitions. [2019-12-27 02:18:43,513 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 4690 transitions. Word has length 26 [2019-12-27 02:18:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:43,513 INFO L462 AbstractCegarLoop]: Abstraction has 2103 states and 4690 transitions. [2019-12-27 02:18:43,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:18:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 4690 transitions. [2019-12-27 02:18:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:18:43,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:43,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:43,517 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-27 02:18:43,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:43,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270516073] [2019-12-27 02:18:43,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:43,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270516073] [2019-12-27 02:18:43,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:43,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:18:43,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21054101] [2019-12-27 02:18:43,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:18:43,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:18:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:43,586 INFO L87 Difference]: Start difference. First operand 2103 states and 4690 transitions. Second operand 5 states. [2019-12-27 02:18:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:44,066 INFO L93 Difference]: Finished difference Result 2987 states and 6548 transitions. [2019-12-27 02:18:44,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:18:44,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:18:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:44,078 INFO L225 Difference]: With dead ends: 2987 [2019-12-27 02:18:44,078 INFO L226 Difference]: Without dead ends: 2987 [2019-12-27 02:18:44,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:18:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2019-12-27 02:18:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2570. [2019-12-27 02:18:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-12-27 02:18:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 5722 transitions. [2019-12-27 02:18:44,139 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 5722 transitions. Word has length 27 [2019-12-27 02:18:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:44,139 INFO L462 AbstractCegarLoop]: Abstraction has 2570 states and 5722 transitions. [2019-12-27 02:18:44,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:18:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 5722 transitions. [2019-12-27 02:18:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:18:44,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:44,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:44,144 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:44,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1454990422, now seen corresponding path program 1 times [2019-12-27 02:18:44,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:44,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414844752] [2019-12-27 02:18:44,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:44,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414844752] [2019-12-27 02:18:44,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:44,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:44,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795945425] [2019-12-27 02:18:44,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:18:44,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:44,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:18:44,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:44,229 INFO L87 Difference]: Start difference. First operand 2570 states and 5722 transitions. Second operand 5 states. [2019-12-27 02:18:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:44,477 INFO L93 Difference]: Finished difference Result 3072 states and 6694 transitions. [2019-12-27 02:18:44,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:18:44,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:18:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:44,485 INFO L225 Difference]: With dead ends: 3072 [2019-12-27 02:18:44,485 INFO L226 Difference]: Without dead ends: 3072 [2019-12-27 02:18:44,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:18:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-12-27 02:18:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2505. [2019-12-27 02:18:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-12-27 02:18:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 5590 transitions. [2019-12-27 02:18:44,542 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 5590 transitions. Word has length 27 [2019-12-27 02:18:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:44,543 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 5590 transitions. [2019-12-27 02:18:44,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:18:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 5590 transitions. [2019-12-27 02:18:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:18:44,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:44,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:44,548 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:44,548 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-27 02:18:44,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:44,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327668676] [2019-12-27 02:18:44,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:44,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327668676] [2019-12-27 02:18:44,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:44,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:44,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633735738] [2019-12-27 02:18:44,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:44,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:44,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:44,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:44,587 INFO L87 Difference]: Start difference. First operand 2505 states and 5590 transitions. Second operand 4 states. [2019-12-27 02:18:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:44,606 INFO L93 Difference]: Finished difference Result 1400 states and 2990 transitions. [2019-12-27 02:18:44,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:18:44,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 02:18:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:44,610 INFO L225 Difference]: With dead ends: 1400 [2019-12-27 02:18:44,611 INFO L226 Difference]: Without dead ends: 1400 [2019-12-27 02:18:44,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-12-27 02:18:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1305. [2019-12-27 02:18:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-12-27 02:18:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2815 transitions. [2019-12-27 02:18:44,636 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2815 transitions. Word has length 28 [2019-12-27 02:18:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:44,636 INFO L462 AbstractCegarLoop]: Abstraction has 1305 states and 2815 transitions. [2019-12-27 02:18:44,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2815 transitions. [2019-12-27 02:18:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:18:44,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:44,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:44,641 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:44,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:44,641 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-27 02:18:44,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:44,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122436287] [2019-12-27 02:18:44,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:44,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122436287] [2019-12-27 02:18:44,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:44,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:18:44,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791051913] [2019-12-27 02:18:44,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:18:44,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:44,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:18:44,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:18:44,735 INFO L87 Difference]: Start difference. First operand 1305 states and 2815 transitions. Second operand 7 states. [2019-12-27 02:18:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:45,088 INFO L93 Difference]: Finished difference Result 3479 states and 7322 transitions. [2019-12-27 02:18:45,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:18:45,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 02:18:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:45,095 INFO L225 Difference]: With dead ends: 3479 [2019-12-27 02:18:45,095 INFO L226 Difference]: Without dead ends: 2269 [2019-12-27 02:18:45,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:18:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2019-12-27 02:18:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1348. [2019-12-27 02:18:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-27 02:18:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2908 transitions. [2019-12-27 02:18:45,131 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2908 transitions. Word has length 50 [2019-12-27 02:18:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:45,131 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 2908 transitions. [2019-12-27 02:18:45,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:18:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2908 transitions. [2019-12-27 02:18:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:18:45,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:45,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:45,135 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:45,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-27 02:18:45,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:45,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609302720] [2019-12-27 02:18:45,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:45,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609302720] [2019-12-27 02:18:45,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:45,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:45,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405754581] [2019-12-27 02:18:45,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:45,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:45,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:45,203 INFO L87 Difference]: Start difference. First operand 1348 states and 2908 transitions. Second operand 3 states. [2019-12-27 02:18:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:45,258 INFO L93 Difference]: Finished difference Result 1629 states and 3459 transitions. [2019-12-27 02:18:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:45,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 02:18:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:45,263 INFO L225 Difference]: With dead ends: 1629 [2019-12-27 02:18:45,263 INFO L226 Difference]: Without dead ends: 1629 [2019-12-27 02:18:45,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-27 02:18:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1368. [2019-12-27 02:18:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-12-27 02:18:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2946 transitions. [2019-12-27 02:18:45,289 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2946 transitions. Word has length 50 [2019-12-27 02:18:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:45,289 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2946 transitions. [2019-12-27 02:18:45,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2946 transitions. [2019-12-27 02:18:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:18:45,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:45,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:45,293 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-27 02:18:45,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:45,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978344405] [2019-12-27 02:18:45,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:45,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978344405] [2019-12-27 02:18:45,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:45,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:18:45,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593414226] [2019-12-27 02:18:45,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:18:45,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:45,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:18:45,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:18:45,448 INFO L87 Difference]: Start difference. First operand 1368 states and 2946 transitions. Second operand 9 states. [2019-12-27 02:18:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:46,298 INFO L93 Difference]: Finished difference Result 1807 states and 3732 transitions. [2019-12-27 02:18:46,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:18:46,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 02:18:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:46,304 INFO L225 Difference]: With dead ends: 1807 [2019-12-27 02:18:46,304 INFO L226 Difference]: Without dead ends: 1807 [2019-12-27 02:18:46,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:18:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2019-12-27 02:18:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1312. [2019-12-27 02:18:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-12-27 02:18:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2755 transitions. [2019-12-27 02:18:46,328 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2755 transitions. Word has length 51 [2019-12-27 02:18:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:46,329 INFO L462 AbstractCegarLoop]: Abstraction has 1312 states and 2755 transitions. [2019-12-27 02:18:46,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:18:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2755 transitions. [2019-12-27 02:18:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:18:46,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:46,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:46,333 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:46,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:46,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1053790121, now seen corresponding path program 2 times [2019-12-27 02:18:46,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:46,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642098793] [2019-12-27 02:18:46,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:46,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642098793] [2019-12-27 02:18:46,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:46,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:46,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149624800] [2019-12-27 02:18:46,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:46,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:46,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:46,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:46,409 INFO L87 Difference]: Start difference. First operand 1312 states and 2755 transitions. Second operand 3 states. [2019-12-27 02:18:46,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:46,428 INFO L93 Difference]: Finished difference Result 1311 states and 2753 transitions. [2019-12-27 02:18:46,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:46,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 02:18:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:46,431 INFO L225 Difference]: With dead ends: 1311 [2019-12-27 02:18:46,431 INFO L226 Difference]: Without dead ends: 1311 [2019-12-27 02:18:46,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-27 02:18:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 995. [2019-12-27 02:18:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-27 02:18:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2128 transitions. [2019-12-27 02:18:46,456 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2128 transitions. Word has length 51 [2019-12-27 02:18:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:46,456 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2128 transitions. [2019-12-27 02:18:46,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2128 transitions. [2019-12-27 02:18:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:18:46,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:46,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:46,461 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:46,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-27 02:18:46,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:46,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820549816] [2019-12-27 02:18:46,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:18:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:18:46,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:18:46,594 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:18:46,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t907~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 |v_ULTIMATE.start_main_~#t907~0.offset_24|) (= 0 v_~z$flush_delayed~0_37) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t907~0.base_35| 4) |v_#length_15|) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35|) |v_ULTIMATE.start_main_~#t907~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35| 1)) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35|)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t907~0.offset=|v_ULTIMATE.start_main_~#t907~0.offset_24|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t907~0.base=|v_ULTIMATE.start_main_~#t907~0.base_35|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t907~0.offset, ULTIMATE.start_main_~#t908~0.base, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t908~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t907~0.base, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 02:18:46,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t908~0.base_13|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13|) |v_ULTIMATE.start_main_~#t908~0.offset_11| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t908~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t908~0.base_13| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t908~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_11|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t908~0.offset, ULTIMATE.start_main_~#t908~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 02:18:46,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= (mod ~z$w_buff1_used~0_Out595429096 256) 0) (= ~z$w_buff1_used~0_Out595429096 ~z$w_buff0_used~0_In595429096) (= ~z$w_buff0~0_In595429096 ~z$w_buff1~0_Out595429096) (= 1 ~z$w_buff0_used~0_Out595429096) (= |P0Thread1of1ForFork0_#in~arg.base_In595429096| P0Thread1of1ForFork0_~arg.base_Out595429096) (= ~z$w_buff0~0_Out595429096 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In595429096| P0Thread1of1ForFork0_~arg.offset_Out595429096) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out595429096| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out595429096) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out595429096| 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In595429096|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In595429096, ~z$w_buff0~0=~z$w_buff0~0_In595429096, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In595429096|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In595429096|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out595429096, ~z$w_buff0~0=~z$w_buff0~0_Out595429096, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out595429096, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out595429096, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In595429096|, ~z$w_buff1~0=~z$w_buff1~0_Out595429096, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out595429096, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out595429096|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out595429096} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:18:46,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1729852578 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out1729852578| ~z$w_buff1_used~0_In1729852578) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In1729852578| |P1Thread1of1ForFork1_#t~ite23_Out1729852578|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1729852578 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1729852578 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In1729852578 256) 0)) (and (= (mod ~z$r_buff1_thd2~0_In1729852578 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out1729852578| |P1Thread1of1ForFork1_#t~ite23_Out1729852578|) (= ~z$w_buff1_used~0_In1729852578 |P1Thread1of1ForFork1_#t~ite23_Out1729852578|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1729852578, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1729852578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1729852578, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1729852578|, ~weak$$choice2~0=~weak$$choice2~0_In1729852578, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1729852578} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1729852578, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1729852578, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1729852578|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1729852578, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1729852578|, ~weak$$choice2~0=~weak$$choice2~0_In1729852578, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1729852578} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 02:18:46,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 02:18:46,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:18:46,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-400850850 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-400850850 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-400850850| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-400850850| ~z$w_buff0_used~0_In-400850850)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-400850850, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-400850850} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-400850850|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-400850850, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-400850850} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:18:46,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1366178130 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1366178130 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1366178130 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1366178130 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1366178130| 0)) (and (= ~z$w_buff1_used~0_In1366178130 |P0Thread1of1ForFork0_#t~ite6_Out1366178130|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1366178130, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1366178130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1366178130, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1366178130} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1366178130|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1366178130, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1366178130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1366178130, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1366178130} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:18:46,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-477802941 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-477802941 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-477802941 ~z$r_buff0_thd1~0_In-477802941)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-477802941)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-477802941, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-477802941} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-477802941, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-477802941|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-477802941} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:18:46,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In1495408591 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1495408591 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1495408591 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1495408591 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1495408591|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1495408591 |P0Thread1of1ForFork0_#t~ite8_Out1495408591|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1495408591, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1495408591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1495408591, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1495408591} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1495408591, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1495408591|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1495408591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1495408591, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1495408591} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:18:46,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-2017101125| |P1Thread1of1ForFork1_#t~ite32_Out-2017101125|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2017101125 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-2017101125 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-2017101125| ~z$w_buff1~0_In-2017101125)) (and .cse1 (= |P1Thread1of1ForFork1_#t~ite32_Out-2017101125| ~z~0_In-2017101125) (or .cse2 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2017101125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017101125, ~z$w_buff1~0=~z$w_buff1~0_In-2017101125, ~z~0=~z~0_In-2017101125} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2017101125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017101125, ~z$w_buff1~0=~z$w_buff1~0_In-2017101125, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2017101125|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-2017101125|, ~z~0=~z~0_In-2017101125} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 02:18:46,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1808512592 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1808512592 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1808512592 |P1Thread1of1ForFork1_#t~ite34_Out-1808512592|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1808512592| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1808512592, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1808512592} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1808512592, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1808512592|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1808512592} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 02:18:46,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-28182700 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-28182700 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-28182700 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-28182700 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-28182700| ~z$w_buff1_used~0_In-28182700)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-28182700|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-28182700, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-28182700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-28182700, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-28182700} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-28182700, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-28182700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-28182700, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-28182700|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-28182700} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 02:18:46,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-469596817 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-469596817 256)))) (or (and (= ~z$r_buff0_thd2~0_In-469596817 |P1Thread1of1ForFork1_#t~ite36_Out-469596817|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-469596817|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-469596817, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-469596817} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-469596817, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-469596817, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-469596817|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 02:18:46,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1236403944 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1236403944 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1236403944 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1236403944 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1236403944 |P1Thread1of1ForFork1_#t~ite37_Out-1236403944|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1236403944| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1236403944, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1236403944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1236403944, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1236403944} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1236403944, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1236403944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1236403944, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1236403944, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1236403944|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:18:46,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:18:46,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:18:46,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 02:18:46,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In831481701 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In831481701 256) 0))) (or (and (= ~z$w_buff1~0_In831481701 |ULTIMATE.start_main_#t~ite40_Out831481701|) (not .cse0) (not .cse1)) (and (= ~z~0_In831481701 |ULTIMATE.start_main_#t~ite40_Out831481701|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In831481701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In831481701, ~z$w_buff1~0=~z$w_buff1~0_In831481701, ~z~0=~z~0_In831481701} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out831481701|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In831481701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In831481701, ~z$w_buff1~0=~z$w_buff1~0_In831481701, ~z~0=~z~0_In831481701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:18:46,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 02:18:46,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In341411182 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In341411182 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out341411182|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In341411182 |ULTIMATE.start_main_#t~ite42_Out341411182|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In341411182, ~z$w_buff0_used~0=~z$w_buff0_used~0_In341411182} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In341411182, ~z$w_buff0_used~0=~z$w_buff0_used~0_In341411182, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out341411182|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:18:46,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1845706918 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1845706918 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1845706918 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1845706918 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-1845706918| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1845706918| ~z$w_buff1_used~0_In-1845706918)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1845706918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1845706918, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1845706918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1845706918} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1845706918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1845706918, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1845706918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1845706918, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1845706918|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 02:18:46,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-914629763 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-914629763 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-914629763| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-914629763| ~z$r_buff0_thd0~0_In-914629763)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-914629763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-914629763} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-914629763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-914629763, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-914629763|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:18:46,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1446437564 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1446437564 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1446437564 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1446437564 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1446437564| ~z$r_buff1_thd0~0_In1446437564)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite45_Out1446437564| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1446437564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1446437564, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1446437564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1446437564} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1446437564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1446437564, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1446437564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1446437564, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1446437564|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:18:46,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:18:46,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:18:46 BasicIcfg [2019-12-27 02:18:46,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:18:46,738 INFO L168 Benchmark]: Toolchain (without parser) took 14697.83 ms. Allocated memory was 138.9 MB in the beginning and 442.0 MB in the end (delta: 303.0 MB). Free memory was 102.1 MB in the beginning and 80.8 MB in the end (delta: 21.3 MB). Peak memory consumption was 324.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:46,740 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 02:18:46,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.91 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 157.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:46,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.16 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:46,747 INFO L168 Benchmark]: Boogie Preprocessor took 43.78 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:46,747 INFO L168 Benchmark]: RCFGBuilder took 776.92 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 107.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:46,748 INFO L168 Benchmark]: TraceAbstraction took 13019.66 ms. Allocated memory was 203.4 MB in the beginning and 442.0 MB in the end (delta: 238.6 MB). Free memory was 107.6 MB in the beginning and 80.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 265.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:46,758 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.91 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 157.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.16 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.78 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 776.92 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 107.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13019.66 ms. Allocated memory was 203.4 MB in the beginning and 442.0 MB in the end (delta: 238.6 MB). Free memory was 107.6 MB in the beginning and 80.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 265.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t907, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t908, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1894 SDtfs, 1526 SDslu, 3762 SDs, 0 SdLazy, 2169 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred 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: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 4230 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 54307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...