/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:49:26,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:49:26,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:49:26,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:49:26,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:49:26,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:49:26,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:49:26,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:49:26,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:49:26,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:49:26,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:49:26,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:49:26,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:49:26,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:49:26,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:49:26,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:49:26,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:49:26,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:49:26,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:49:26,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:49:26,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:49:26,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:49:26,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:49:26,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:49:26,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:49:26,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:49:26,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:49:26,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:49:26,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:49:26,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:49:26,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:49:26,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:49:26,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:49:26,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:49:26,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:49:26,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:49:26,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:49:26,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:49:26,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:49:26,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:49:26,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:49:26,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:49:26,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:49:26,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:49:26,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:49:26,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:49:26,808 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:49:26,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:49:26,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:49:26,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:49:26,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:49:26,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:49:26,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:49:26,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:49:26,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:49:26,811 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:49:26,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:49:26,811 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:49:26,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:49:26,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:49:26,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:49:26,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:49:26,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:49:26,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:49:26,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:49:26,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:49:26,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:49:26,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:49:26,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:49:26,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:49:26,815 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:49:26,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:49:27,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:49:27,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:49:27,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:49:27,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:49:27,114 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:49:27,115 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-18 12:49:27,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080ac5607/4826e0715a984f289f5b0f90c2a9d53d/FLAGbcca06d71 [2019-12-18 12:49:27,763 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:49:27,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-18 12:49:27,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080ac5607/4826e0715a984f289f5b0f90c2a9d53d/FLAGbcca06d71 [2019-12-18 12:49:27,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080ac5607/4826e0715a984f289f5b0f90c2a9d53d [2019-12-18 12:49:27,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:49:27,987 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:49:27,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:49:27,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:49:27,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:49:27,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:49:27" (1/1) ... [2019-12-18 12:49:27,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6968dd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:27, skipping insertion in model container [2019-12-18 12:49:27,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:49:27" (1/1) ... [2019-12-18 12:49:28,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:49:28,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:49:28,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:49:28,581 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:49:28,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:49:28,732 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:49:28,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28 WrapperNode [2019-12-18 12:49:28,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:49:28,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:49:28,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:49:28,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:49:28,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (1/1) ... [2019-12-18 12:49:28,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (1/1) ... [2019-12-18 12:49:28,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:49:28,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:49:28,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:49:28,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:49:28,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (1/1) ... [2019-12-18 12:49:28,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (1/1) ... [2019-12-18 12:49:28,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (1/1) ... [2019-12-18 12:49:28,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (1/1) ... [2019-12-18 12:49:28,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (1/1) ... [2019-12-18 12:49:28,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (1/1) ... [2019-12-18 12:49:28,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (1/1) ... [2019-12-18 12:49:28,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:49:28,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:49:28,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:49:28,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:49:28,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (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-18 12:49:28,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:49:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:49:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:49:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:49:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:49:28,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:49:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:49:28,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:49:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:49:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:49:28,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:49:28,907 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:49:29,572 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:49:29,572 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:49:29,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:49:29 BoogieIcfgContainer [2019-12-18 12:49:29,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:49:29,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:49:29,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:49:29,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:49:29,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:49:27" (1/3) ... [2019-12-18 12:49:29,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3075fc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:49:29, skipping insertion in model container [2019-12-18 12:49:29,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:28" (2/3) ... [2019-12-18 12:49:29,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3075fc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:49:29, skipping insertion in model container [2019-12-18 12:49:29,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:49:29" (3/3) ... [2019-12-18 12:49:29,588 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.oepc.i [2019-12-18 12:49:29,601 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:49:29,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:49:29,612 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:49:29,614 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:49:29,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,683 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,755 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:29,771 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 12:49:29,791 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:49:29,791 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:49:29,791 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:49:29,791 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:49:29,792 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:49:29,792 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:49:29,792 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:49:29,792 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:49:29,808 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 12:49:29,810 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 12:49:29,887 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 12:49:29,887 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:49:29,904 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:49:29,930 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 12:49:29,970 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 12:49:29,970 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:49:29,978 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:49:29,995 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 12:49:29,996 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:49:33,641 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-12-18 12:49:35,003 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 12:49:35,111 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 12:49:35,162 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-18 12:49:35,162 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 12:49:35,166 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-18 12:49:35,595 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 12:49:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 12:49:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:49:35,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:35,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:49:35,605 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-18 12:49:35,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:35,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862053836] [2019-12-18 12:49:35,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:35,834 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-18 12:49:35,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862053836] [2019-12-18 12:49:35,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:35,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:49:35,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188648068] [2019-12-18 12:49:35,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:35,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:35,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:35,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:35,865 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 12:49:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:36,205 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-18 12:49:36,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:36,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:49:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:36,288 INFO L225 Difference]: With dead ends: 8468 [2019-12-18 12:49:36,289 INFO L226 Difference]: Without dead ends: 7976 [2019-12-18 12:49:36,290 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-18 12:49:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-18 12:49:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-18 12:49:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-18 12:49:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-18 12:49:36,711 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-18 12:49:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:36,712 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-18 12:49:36,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-18 12:49:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:49:36,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:36,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:36,716 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:36,716 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-18 12:49:36,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:36,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970916122] [2019-12-18 12:49:36,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:36,851 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-18 12:49:36,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970916122] [2019-12-18 12:49:36,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:36,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:49:36,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560668837] [2019-12-18 12:49:36,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:49:36,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:36,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:49:36,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:49:36,855 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-18 12:49:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:36,919 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-12-18 12:49:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:49:36,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:49:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:36,928 INFO L225 Difference]: With dead ends: 1834 [2019-12-18 12:49:36,928 INFO L226 Difference]: Without dead ends: 1342 [2019-12-18 12:49:36,931 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-18 12:49:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-18 12:49:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-12-18 12:49:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-18 12:49:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-12-18 12:49:36,976 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-12-18 12:49:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:36,977 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-12-18 12:49:36,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:49:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-12-18 12:49:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:49:36,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:36,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:36,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:36,985 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-18 12:49:36,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:36,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581482895] [2019-12-18 12:49:36,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:37,116 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-18 12:49:37,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581482895] [2019-12-18 12:49:37,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:37,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:37,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474570575] [2019-12-18 12:49:37,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:49:37,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:37,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:49:37,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:49:37,119 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-12-18 12:49:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:37,319 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-12-18 12:49:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:49:37,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:49:37,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:37,329 INFO L225 Difference]: With dead ends: 1673 [2019-12-18 12:49:37,329 INFO L226 Difference]: Without dead ends: 1673 [2019-12-18 12:49:37,330 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-18 12:49:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-18 12:49:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-12-18 12:49:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-18 12:49:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-12-18 12:49:37,414 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-12-18 12:49:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:37,415 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-12-18 12:49:37,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:49:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-12-18 12:49:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:49:37,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:37,418 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] [2019-12-18 12:49:37,418 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:37,419 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-18 12:49:37,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:37,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463205489] [2019-12-18 12:49:37,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:37,557 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-18 12:49:37,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463205489] [2019-12-18 12:49:37,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:37,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:37,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788137010] [2019-12-18 12:49:37,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:49:37,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:37,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:49:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:49:37,559 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-12-18 12:49:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:38,310 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-12-18 12:49:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:49:38,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 12:49:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:38,332 INFO L225 Difference]: With dead ends: 4481 [2019-12-18 12:49:38,333 INFO L226 Difference]: Without dead ends: 4446 [2019-12-18 12:49:38,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:49:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-18 12:49:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-12-18 12:49:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-12-18 12:49:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-12-18 12:49:38,404 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-12-18 12:49:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:38,405 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-12-18 12:49:38,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:49:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-12-18 12:49:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:49:38,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:38,408 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-18 12:49:38,408 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:38,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:38,409 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-12-18 12:49:38,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:38,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892732043] [2019-12-18 12:49:38,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:38,455 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-18 12:49:38,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892732043] [2019-12-18 12:49:38,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:38,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:49:38,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92080454] [2019-12-18 12:49:38,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:38,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:38,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:38,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:38,457 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 3 states. [2019-12-18 12:49:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:38,470 INFO L93 Difference]: Finished difference Result 2168 states and 4907 transitions. [2019-12-18 12:49:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:38,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 12:49:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:38,482 INFO L225 Difference]: With dead ends: 2168 [2019-12-18 12:49:38,483 INFO L226 Difference]: Without dead ends: 2168 [2019-12-18 12:49:38,483 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-18 12:49:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-12-18 12:49:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2019-12-18 12:49:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-12-18 12:49:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 4907 transitions. [2019-12-18 12:49:38,529 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 4907 transitions. Word has length 26 [2019-12-18 12:49:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:38,530 INFO L462 AbstractCegarLoop]: Abstraction has 2168 states and 4907 transitions. [2019-12-18 12:49:38,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 4907 transitions. [2019-12-18 12:49:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:49:38,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:38,533 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-18 12:49:38,533 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:38,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-18 12:49:38,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:38,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291416564] [2019-12-18 12:49:38,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:38,659 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-18 12:49:38,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291416564] [2019-12-18 12:49:38,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:38,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:38,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655899024] [2019-12-18 12:49:38,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:49:38,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:38,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:49:38,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:49:38,665 INFO L87 Difference]: Start difference. First operand 2168 states and 4907 transitions. Second operand 6 states. [2019-12-18 12:49:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:39,428 INFO L93 Difference]: Finished difference Result 4358 states and 9517 transitions. [2019-12-18 12:49:39,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:49:39,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 12:49:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:39,442 INFO L225 Difference]: With dead ends: 4358 [2019-12-18 12:49:39,442 INFO L226 Difference]: Without dead ends: 4329 [2019-12-18 12:49:39,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:49:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2019-12-18 12:49:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 2043. [2019-12-18 12:49:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2019-12-18 12:49:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 4651 transitions. [2019-12-18 12:49:39,506 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 4651 transitions. Word has length 26 [2019-12-18 12:49:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:39,506 INFO L462 AbstractCegarLoop]: Abstraction has 2043 states and 4651 transitions. [2019-12-18 12:49:39,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:49:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 4651 transitions. [2019-12-18 12:49:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:49:39,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:39,509 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-18 12:49:39,510 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1022467216, now seen corresponding path program 1 times [2019-12-18 12:49:39,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:39,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752588165] [2019-12-18 12:49:39,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:39,550 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-18 12:49:39,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752588165] [2019-12-18 12:49:39,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:39,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:39,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485607425] [2019-12-18 12:49:39,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:39,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:39,552 INFO L87 Difference]: Start difference. First operand 2043 states and 4651 transitions. Second operand 3 states. [2019-12-18 12:49:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:39,575 INFO L93 Difference]: Finished difference Result 3738 states and 8517 transitions. [2019-12-18 12:49:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:39,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:49:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:39,582 INFO L225 Difference]: With dead ends: 3738 [2019-12-18 12:49:39,582 INFO L226 Difference]: Without dead ends: 1966 [2019-12-18 12:49:39,582 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-18 12:49:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-18 12:49:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1950. [2019-12-18 12:49:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-18 12:49:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4342 transitions. [2019-12-18 12:49:39,623 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4342 transitions. Word has length 27 [2019-12-18 12:49:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:39,623 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4342 transitions. [2019-12-18 12:49:39,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4342 transitions. [2019-12-18 12:49:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:49:39,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:39,627 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-18 12:49:39,627 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1564138658, now seen corresponding path program 2 times [2019-12-18 12:49:39,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:39,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952249636] [2019-12-18 12:49:39,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:39,701 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-18 12:49:39,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952249636] [2019-12-18 12:49:39,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:39,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:49:39,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172254200] [2019-12-18 12:49:39,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:49:39,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:39,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:49:39,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:39,704 INFO L87 Difference]: Start difference. First operand 1950 states and 4342 transitions. Second operand 5 states. [2019-12-18 12:49:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:40,210 INFO L93 Difference]: Finished difference Result 2942 states and 6436 transitions. [2019-12-18 12:49:40,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:49:40,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:49:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:40,219 INFO L225 Difference]: With dead ends: 2942 [2019-12-18 12:49:40,219 INFO L226 Difference]: Without dead ends: 2942 [2019-12-18 12:49:40,220 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-18 12:49:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2019-12-18 12:49:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2507. [2019-12-18 12:49:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-12-18 12:49:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 5550 transitions. [2019-12-18 12:49:40,281 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 5550 transitions. Word has length 27 [2019-12-18 12:49:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:40,282 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 5550 transitions. [2019-12-18 12:49:40,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:49:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 5550 transitions. [2019-12-18 12:49:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:49:40,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:40,286 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-18 12:49:40,286 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:40,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:40,287 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-18 12:49:40,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:40,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571057269] [2019-12-18 12:49:40,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:40,370 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-18 12:49:40,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571057269] [2019-12-18 12:49:40,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:40,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:40,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159951313] [2019-12-18 12:49:40,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:49:40,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:49:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:40,374 INFO L87 Difference]: Start difference. First operand 2507 states and 5550 transitions. Second operand 5 states. [2019-12-18 12:49:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:40,417 INFO L93 Difference]: Finished difference Result 1526 states and 3206 transitions. [2019-12-18 12:49:40,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:49:40,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:49:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:40,421 INFO L225 Difference]: With dead ends: 1526 [2019-12-18 12:49:40,421 INFO L226 Difference]: Without dead ends: 1282 [2019-12-18 12:49:40,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:49:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-12-18 12:49:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1187. [2019-12-18 12:49:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-12-18 12:49:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2573 transitions. [2019-12-18 12:49:40,448 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2573 transitions. Word has length 28 [2019-12-18 12:49:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:40,448 INFO L462 AbstractCegarLoop]: Abstraction has 1187 states and 2573 transitions. [2019-12-18 12:49:40,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:49:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2573 transitions. [2019-12-18 12:49:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:49:40,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:40,453 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-18 12:49:40,453 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:40,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash -282366580, now seen corresponding path program 1 times [2019-12-18 12:49:40,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:40,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387841256] [2019-12-18 12:49:40,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:40,603 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-18 12:49:40,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387841256] [2019-12-18 12:49:40,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:40,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:49:40,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625720954] [2019-12-18 12:49:40,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:49:40,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:49:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:49:40,605 INFO L87 Difference]: Start difference. First operand 1187 states and 2573 transitions. Second operand 7 states. [2019-12-18 12:49:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:40,821 INFO L93 Difference]: Finished difference Result 2079 states and 4404 transitions. [2019-12-18 12:49:40,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:49:40,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 12:49:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:40,825 INFO L225 Difference]: With dead ends: 2079 [2019-12-18 12:49:40,825 INFO L226 Difference]: Without dead ends: 1402 [2019-12-18 12:49:40,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:49:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-18 12:49:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1193. [2019-12-18 12:49:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-18 12:49:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2562 transitions. [2019-12-18 12:49:40,849 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2562 transitions. Word has length 51 [2019-12-18 12:49:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:40,850 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2562 transitions. [2019-12-18 12:49:40,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:49:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2562 transitions. [2019-12-18 12:49:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:49:40,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:40,853 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-18 12:49:40,853 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1667743284, now seen corresponding path program 2 times [2019-12-18 12:49:40,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:40,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095895432] [2019-12-18 12:49:40,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:40,998 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-18 12:49:40,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095895432] [2019-12-18 12:49:40,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:40,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:49:40,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207618660] [2019-12-18 12:49:41,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:49:41,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:41,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:49:41,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:49:41,002 INFO L87 Difference]: Start difference. First operand 1193 states and 2562 transitions. Second operand 7 states. [2019-12-18 12:49:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:42,168 INFO L93 Difference]: Finished difference Result 2539 states and 5262 transitions. [2019-12-18 12:49:42,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:49:42,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 12:49:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:42,174 INFO L225 Difference]: With dead ends: 2539 [2019-12-18 12:49:42,175 INFO L226 Difference]: Without dead ends: 2539 [2019-12-18 12:49:42,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:49:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2019-12-18 12:49:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 1266. [2019-12-18 12:49:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-18 12:49:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 2729 transitions. [2019-12-18 12:49:42,210 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 2729 transitions. Word has length 51 [2019-12-18 12:49:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:42,211 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 2729 transitions. [2019-12-18 12:49:42,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:49:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 2729 transitions. [2019-12-18 12:49:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:49:42,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:42,214 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-18 12:49:42,214 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:42,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1259363204, now seen corresponding path program 3 times [2019-12-18 12:49:42,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:42,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597108763] [2019-12-18 12:49:42,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:42,306 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-18 12:49:42,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597108763] [2019-12-18 12:49:42,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:42,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:49:42,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585851502] [2019-12-18 12:49:42,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:49:42,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:49:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:42,309 INFO L87 Difference]: Start difference. First operand 1266 states and 2729 transitions. Second operand 5 states. [2019-12-18 12:49:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:42,522 INFO L93 Difference]: Finished difference Result 1395 states and 2962 transitions. [2019-12-18 12:49:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:49:42,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 12:49:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:42,527 INFO L225 Difference]: With dead ends: 1395 [2019-12-18 12:49:42,527 INFO L226 Difference]: Without dead ends: 1395 [2019-12-18 12:49:42,527 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-18 12:49:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2019-12-18 12:49:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1274. [2019-12-18 12:49:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-12-18 12:49:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 2746 transitions. [2019-12-18 12:49:42,550 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 2746 transitions. Word has length 51 [2019-12-18 12:49:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:42,551 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 2746 transitions. [2019-12-18 12:49:42,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:49:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 2746 transitions. [2019-12-18 12:49:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:49:42,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:42,555 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-18 12:49:42,555 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:42,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash -878142292, now seen corresponding path program 4 times [2019-12-18 12:49:42,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:42,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295299316] [2019-12-18 12:49:42,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:42,671 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-18 12:49:42,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295299316] [2019-12-18 12:49:42,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:42,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:42,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115508436] [2019-12-18 12:49:42,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:42,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:42,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:42,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:42,674 INFO L87 Difference]: Start difference. First operand 1274 states and 2746 transitions. Second operand 3 states. [2019-12-18 12:49:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:42,694 INFO L93 Difference]: Finished difference Result 1273 states and 2744 transitions. [2019-12-18 12:49:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:42,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 12:49:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:42,698 INFO L225 Difference]: With dead ends: 1273 [2019-12-18 12:49:42,698 INFO L226 Difference]: Without dead ends: 1273 [2019-12-18 12:49:42,700 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-18 12:49:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-12-18 12:49:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1007. [2019-12-18 12:49:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-12-18 12:49:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 2197 transitions. [2019-12-18 12:49:42,726 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 2197 transitions. Word has length 51 [2019-12-18 12:49:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:42,727 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 2197 transitions. [2019-12-18 12:49:42,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 2197 transitions. [2019-12-18 12:49:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 12:49:42,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:42,730 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-18 12:49:42,731 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:42,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2078058895, now seen corresponding path program 1 times [2019-12-18 12:49:42,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:42,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526479142] [2019-12-18 12:49:42,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:42,943 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-18 12:49:42,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526479142] [2019-12-18 12:49:42,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:42,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:49:42,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89670453] [2019-12-18 12:49:42,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:49:42,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:42,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:49:42,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:49:42,948 INFO L87 Difference]: Start difference. First operand 1007 states and 2197 transitions. Second operand 4 states. [2019-12-18 12:49:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:43,010 INFO L93 Difference]: Finished difference Result 1234 states and 2673 transitions. [2019-12-18 12:49:43,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:43,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 12:49:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:43,013 INFO L225 Difference]: With dead ends: 1234 [2019-12-18 12:49:43,013 INFO L226 Difference]: Without dead ends: 1234 [2019-12-18 12:49:43,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:49:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-12-18 12:49:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 903. [2019-12-18 12:49:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-12-18 12:49:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1961 transitions. [2019-12-18 12:49:43,031 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1961 transitions. Word has length 52 [2019-12-18 12:49:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:43,032 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1961 transitions. [2019-12-18 12:49:43,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:49:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1961 transitions. [2019-12-18 12:49:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:49:43,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:43,034 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, 1] [2019-12-18 12:49:43,035 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:43,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-18 12:49:43,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:43,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290642206] [2019-12-18 12:49:43,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:49:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:49:43,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:49:43,253 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:49:43,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29| 1) |v_#valid_52|) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= v_~y$mem_tmp~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29|) 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29|) |v_ULTIMATE.start_main_~#t593~0.offset_20| 0)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t593~0.base_29|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t593~0.base_29| 4)) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= |v_ULTIMATE.start_main_~#t593~0.offset_20| 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_~#t593~0.base=|v_ULTIMATE.start_main_~#t593~0.base_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t593~0.offset=|v_ULTIMATE.start_main_~#t593~0.offset_20|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t593~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t594~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t593~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:49:43,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12|) |v_ULTIMATE.start_main_~#t594~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t594~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t594~0.base_12|)) (= |v_ULTIMATE.start_main_~#t594~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t594~0.base_12| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.base, ULTIMATE.start_main_~#t594~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 12:49:43,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 12:49:43,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In735093215 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In735093215 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out735093215| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out735093215| ~y$w_buff0_used~0_In735093215) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In735093215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In735093215} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out735093215|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In735093215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In735093215} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 12:49:43,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In452241388 256) 0))) (or (and (= ~y$w_buff0~0_In452241388 |P1Thread1of1ForFork1_#t~ite15_Out452241388|) (= |P1Thread1of1ForFork1_#t~ite14_In452241388| |P1Thread1of1ForFork1_#t~ite14_Out452241388|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out452241388| |P1Thread1of1ForFork1_#t~ite15_Out452241388|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In452241388 256)))) (or (= (mod ~y$w_buff0_used~0_In452241388 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In452241388 256))) (and (= (mod ~y$w_buff1_used~0_In452241388 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out452241388| ~y$w_buff0~0_In452241388)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In452241388, ~y$w_buff0_used~0=~y$w_buff0_used~0_In452241388, ~y$w_buff0~0=~y$w_buff0~0_In452241388, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In452241388, ~weak$$choice2~0=~weak$$choice2~0_In452241388, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In452241388|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452241388} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In452241388, ~y$w_buff0_used~0=~y$w_buff0_used~0_In452241388, ~y$w_buff0~0=~y$w_buff0~0_In452241388, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In452241388, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out452241388|, ~weak$$choice2~0=~weak$$choice2~0_In452241388, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out452241388|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452241388} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 12:49:43,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In641527442 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out641527442| ~y$w_buff1~0_In641527442) (= |P1Thread1of1ForFork1_#t~ite17_In641527442| |P1Thread1of1ForFork1_#t~ite17_Out641527442|)) (and (= ~y$w_buff1~0_In641527442 |P1Thread1of1ForFork1_#t~ite17_Out641527442|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In641527442 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In641527442 256)) (and (= (mod ~y$w_buff1_used~0_In641527442 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In641527442 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite18_Out641527442| |P1Thread1of1ForFork1_#t~ite17_Out641527442|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In641527442, ~y$w_buff1~0=~y$w_buff1~0_In641527442, ~y$w_buff0_used~0=~y$w_buff0_used~0_In641527442, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In641527442, ~weak$$choice2~0=~weak$$choice2~0_In641527442, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In641527442|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641527442} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In641527442, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out641527442|, ~y$w_buff1~0=~y$w_buff1~0_In641527442, ~y$w_buff0_used~0=~y$w_buff0_used~0_In641527442, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In641527442, ~weak$$choice2~0=~weak$$choice2~0_In641527442, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out641527442|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641527442} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 12:49:43,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1390586113 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1390586113 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1390586113 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1390586113 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1390586113| 0)) (and (= ~y$w_buff1_used~0_In1390586113 |P0Thread1of1ForFork0_#t~ite6_Out1390586113|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1390586113, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390586113, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1390586113, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390586113} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1390586113|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1390586113, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390586113, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1390586113, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390586113} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 12:49:43,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In904453096 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In904453096 256)))) (or (and (= ~y$r_buff0_thd1~0_Out904453096 ~y$r_buff0_thd1~0_In904453096) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd1~0_Out904453096 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In904453096, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In904453096} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In904453096, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out904453096|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out904453096} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:49:43,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In1391191073 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1391191073 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1391191073 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1391191073 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1391191073| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out1391191073| ~y$r_buff1_thd1~0_In1391191073)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1391191073, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1391191073, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1391191073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1391191073} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1391191073, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1391191073, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1391191073|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1391191073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1391191073} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 12:49:43,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-951463160 256)))) (or (and (= ~y$w_buff0_used~0_In-951463160 |P1Thread1of1ForFork1_#t~ite20_Out-951463160|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-951463160 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-951463160 256) 0)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-951463160 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-951463160 256)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out-951463160| |P1Thread1of1ForFork1_#t~ite20_Out-951463160|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-951463160| |P1Thread1of1ForFork1_#t~ite20_Out-951463160|) (= |P1Thread1of1ForFork1_#t~ite21_Out-951463160| ~y$w_buff0_used~0_In-951463160)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-951463160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-951463160, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-951463160|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-951463160, ~weak$$choice2~0=~weak$$choice2~0_In-951463160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951463160} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-951463160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-951463160, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-951463160|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-951463160, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-951463160|, ~weak$$choice2~0=~weak$$choice2~0_In-951463160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951463160} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 12:49:43,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 12:49:43,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In115933305 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out115933305| ~y$r_buff1_thd2~0_In115933305) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In115933305 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In115933305 256)) (and (= 0 (mod ~y$w_buff1_used~0_In115933305 256)) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In115933305 256)) .cse0))) (= |P1Thread1of1ForFork1_#t~ite29_Out115933305| |P1Thread1of1ForFork1_#t~ite30_Out115933305|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In115933305| |P1Thread1of1ForFork1_#t~ite29_Out115933305|) (= |P1Thread1of1ForFork1_#t~ite30_Out115933305| ~y$r_buff1_thd2~0_In115933305)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In115933305, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In115933305|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In115933305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In115933305, ~weak$$choice2~0=~weak$$choice2~0_In115933305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In115933305} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In115933305, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out115933305|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out115933305|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In115933305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In115933305, ~weak$$choice2~0=~weak$$choice2~0_In115933305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In115933305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 12:49:43,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:49:43,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 12:49:43,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1626410468 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1626410468 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1626410468| ~y$w_buff1~0_In1626410468) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1626410468| ~y~0_In1626410468)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1626410468, ~y$w_buff1~0=~y$w_buff1~0_In1626410468, ~y~0=~y~0_In1626410468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1626410468} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1626410468, ~y$w_buff1~0=~y$w_buff1~0_In1626410468, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1626410468|, ~y~0=~y~0_In1626410468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1626410468} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 12:49:43,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 12:49:43,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1220971812 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1220971812 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1220971812| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1220971812| ~y$w_buff0_used~0_In-1220971812) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1220971812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1220971812} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1220971812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1220971812, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1220971812|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 12:49:43,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1878965937 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1878965937 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1878965937 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1878965937 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1878965937 |P1Thread1of1ForFork1_#t~ite35_Out1878965937|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1878965937|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1878965937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1878965937, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1878965937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878965937} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1878965937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1878965937, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1878965937, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1878965937|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878965937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 12:49:43,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1860575950 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1860575950 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1860575950| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1860575950| ~y$r_buff0_thd2~0_In1860575950)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1860575950, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1860575950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1860575950, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1860575950, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1860575950|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 12:49:43,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In591739048 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In591739048 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In591739048 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In591739048 256)))) (or (and (= ~y$r_buff1_thd2~0_In591739048 |P1Thread1of1ForFork1_#t~ite37_Out591739048|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out591739048| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In591739048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In591739048, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In591739048, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591739048} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In591739048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In591739048, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In591739048, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out591739048|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591739048} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:49:43,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:49:43,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:49:43,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1360874274 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1360874274 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1360874274| ~y$w_buff1~0_In-1360874274) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-1360874274 |ULTIMATE.start_main_#t~ite40_Out-1360874274|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1360874274, ~y~0=~y~0_In-1360874274, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1360874274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1360874274} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1360874274|, ~y$w_buff1~0=~y$w_buff1~0_In-1360874274, ~y~0=~y~0_In-1360874274, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1360874274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1360874274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 12:49:43,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |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_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 12:49:43,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1246383888 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1246383888 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1246383888| ~y$w_buff0_used~0_In-1246383888) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1246383888| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1246383888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1246383888} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1246383888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1246383888, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1246383888|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:49:43,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2119036253 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-2119036253 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-2119036253 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-2119036253 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-2119036253|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-2119036253 |ULTIMATE.start_main_#t~ite43_Out-2119036253|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119036253, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119036253, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119036253, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119036253} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119036253, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119036253, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2119036253|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119036253, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119036253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 12:49:43,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1944397223 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1944397223 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1944397223| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1944397223| ~y$r_buff0_thd0~0_In1944397223)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1944397223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1944397223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1944397223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1944397223, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1944397223|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:49:43,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In846735983 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In846735983 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In846735983 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In846735983 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out846735983|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In846735983 |ULTIMATE.start_main_#t~ite45_Out846735983|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In846735983, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In846735983, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In846735983, ~y$w_buff1_used~0=~y$w_buff1_used~0_In846735983} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In846735983, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In846735983, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In846735983, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out846735983|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In846735983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:49:43,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:49:43,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:49:43 BasicIcfg [2019-12-18 12:49:43,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:49:43,371 INFO L168 Benchmark]: Toolchain (without parser) took 15384.19 ms. Allocated memory was 139.5 MB in the beginning and 443.5 MB in the end (delta: 304.1 MB). Free memory was 102.0 MB in the beginning and 320.1 MB in the end (delta: -218.2 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:43,372 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:49:43,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.22 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 159.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:43,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.18 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 156.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:43,374 INFO L168 Benchmark]: Boogie Preprocessor took 38.22 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 154.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:43,374 INFO L168 Benchmark]: RCFGBuilder took 729.84 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 110.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:43,375 INFO L168 Benchmark]: TraceAbstraction took 13792.37 ms. Allocated memory was 204.5 MB in the beginning and 443.5 MB in the end (delta: 239.1 MB). Free memory was 109.4 MB in the beginning and 320.1 MB in the end (delta: -210.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:43,379 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.26 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.22 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 159.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.18 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 156.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.22 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 154.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 729.84 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 110.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13792.37 ms. Allocated memory was 204.5 MB in the beginning and 443.5 MB in the end (delta: 239.1 MB). Free memory was 109.4 MB in the beginning and 320.1 MB in the end (delta: -210.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1862 SDtfs, 1908 SDslu, 3534 SDs, 0 SdLazy, 2534 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 7373 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 82143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...