/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:54:51,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:54:51,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:54:51,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:54:51,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:54:51,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:54:51,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:54:51,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:54:51,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:54:51,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:54:51,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:54:51,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:54:51,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:54:51,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:54:51,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:54:51,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:54:51,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:54:51,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:54:51,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:54:51,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:54:51,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:54:51,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:54:51,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:54:51,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:54:51,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:54:51,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:54:51,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:54:51,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:54:51,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:54:51,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:54:51,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:54:51,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:54:51,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:54:51,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:54:51,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:54:51,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:54:51,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:54:51,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:54:51,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:54:51,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:54:51,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:54:51,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:54:51,727 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:54:51,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:54:51,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:54:51,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:54:51,729 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:54:51,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:54:51,729 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:54:51,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:54:51,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:54:51,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:54:51,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:54:51,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:54:51,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:54:51,731 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:54:51,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:54:51,731 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:54:51,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:54:51,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:54:51,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:54:51,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:54:51,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:54:51,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:54:51,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:54:51,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:54:51,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:54:51,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:54:51,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:54:51,733 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:54:51,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:54:51,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:54:52,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:54:52,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:54:52,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:54:52,084 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:54:52,086 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:54:52,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-27 05:54:52,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e0881ca/ae8840d403134f2196a145f2dbed74e4/FLAGc093644bd [2019-12-27 05:54:52,683 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:54:52,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-27 05:54:52,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e0881ca/ae8840d403134f2196a145f2dbed74e4/FLAGc093644bd [2019-12-27 05:54:52,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e0881ca/ae8840d403134f2196a145f2dbed74e4 [2019-12-27 05:54:52,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:54:53,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:54:53,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:54:53,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:54:53,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:54:53,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:54:52" (1/1) ... [2019-12-27 05:54:53,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53, skipping insertion in model container [2019-12-27 05:54:53,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:54:52" (1/1) ... [2019-12-27 05:54:53,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:54:53,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:54:53,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:54:53,613 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:54:53,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:54:53,771 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:54:53,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53 WrapperNode [2019-12-27 05:54:53,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:54:53,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:54:53,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:54:53,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:54:53,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... [2019-12-27 05:54:53,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... [2019-12-27 05:54:53,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:54:53,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:54:53,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:54:53,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:54:53,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... [2019-12-27 05:54:53,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... [2019-12-27 05:54:53,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... [2019-12-27 05:54:53,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... [2019-12-27 05:54:53,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... [2019-12-27 05:54:53,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... [2019-12-27 05:54:53,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... [2019-12-27 05:54:53,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:54:53,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:54:53,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:54:53,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:54:53,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:54:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:54:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:54:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:54:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:54:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:54:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:54:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:54:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:54:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:54:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:54:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:54:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:54:53,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:54:53,975 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:54:54,732 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:54:54,733 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:54:54,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:54:54 BoogieIcfgContainer [2019-12-27 05:54:54,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:54:54,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:54:54,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:54:54,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:54:54,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:54:52" (1/3) ... [2019-12-27 05:54:54,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f100cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:54:54, skipping insertion in model container [2019-12-27 05:54:54,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:53" (2/3) ... [2019-12-27 05:54:54,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f100cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:54:54, skipping insertion in model container [2019-12-27 05:54:54,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:54:54" (3/3) ... [2019-12-27 05:54:54,744 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.opt.i [2019-12-27 05:54:54,756 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:54:54,756 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:54:54,768 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:54:54,769 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:54:54,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,828 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,830 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,830 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,847 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,847 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,891 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,893 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:54,923 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:54:54,945 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:54:54,945 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:54:54,945 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:54:54,945 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:54:54,945 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:54:54,945 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:54:54,946 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:54:54,946 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:54:54,962 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 05:54:54,964 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:54:55,071 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:54:55,071 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:54:55,088 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:54:55,113 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:54:55,168 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:54:55,168 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:54:55,176 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:54:55,199 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:54:55,200 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:54:58,145 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 05:54:58,777 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 05:54:58,909 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 05:54:58,935 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-27 05:54:58,935 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 05:54:58,940 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 05:55:18,978 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-27 05:55:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-27 05:55:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:55:18,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:18,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:55:18,987 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:18,992 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-27 05:55:19,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:19,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319365266] [2019-12-27 05:55:19,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:19,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319365266] [2019-12-27 05:55:19,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:19,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:55:19,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7777289] [2019-12-27 05:55:19,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:19,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:19,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:19,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:19,275 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-27 05:55:20,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:20,912 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-27 05:55:20,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:20,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:55:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:21,744 INFO L225 Difference]: With dead ends: 120482 [2019-12-27 05:55:21,744 INFO L226 Difference]: Without dead ends: 113384 [2019-12-27 05:55:21,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-27 05:55:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-27 05:55:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-27 05:55:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-27 05:55:32,268 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-27 05:55:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:32,269 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-27 05:55:32,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-27 05:55:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:55:32,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:32,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:32,274 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-27 05:55:32,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:32,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348502796] [2019-12-27 05:55:32,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:32,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348502796] [2019-12-27 05:55:32,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:32,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:32,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917117667] [2019-12-27 05:55:32,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:55:32,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:32,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:55:32,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:55:32,409 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-27 05:55:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:38,208 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-27 05:55:38,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:55:38,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:55:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:38,813 INFO L225 Difference]: With dead ends: 179498 [2019-12-27 05:55:38,813 INFO L226 Difference]: Without dead ends: 179449 [2019-12-27 05:55:38,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-27 05:55:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-27 05:55:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-27 05:55:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-27 05:55:51,144 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-27 05:55:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:51,144 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-27 05:55:51,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:55:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-27 05:55:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:55:51,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:51,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:51,151 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-27 05:55:51,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:51,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929443732] [2019-12-27 05:55:51,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:51,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929443732] [2019-12-27 05:55:51,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:51,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:51,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886578877] [2019-12-27 05:55:51,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:51,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:51,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:51,210 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-27 05:55:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:56,170 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-27 05:55:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:56,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:55:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:56,262 INFO L225 Difference]: With dead ends: 34413 [2019-12-27 05:55:56,262 INFO L226 Difference]: Without dead ends: 34413 [2019-12-27 05:55:56,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-27 05:55:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-27 05:55:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-27 05:55:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-27 05:55:56,962 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-27 05:55:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:56,963 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-27 05:55:56,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-27 05:55:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:55:56,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:56,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:56,966 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-27 05:55:56,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:56,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609781309] [2019-12-27 05:55:56,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:57,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609781309] [2019-12-27 05:55:57,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:57,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:55:57,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758032392] [2019-12-27 05:55:57,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:57,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:57,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:57,039 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-27 05:55:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:57,243 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-27 05:55:57,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:57,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 05:55:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:57,354 INFO L225 Difference]: With dead ends: 54627 [2019-12-27 05:55:57,354 INFO L226 Difference]: Without dead ends: 54627 [2019-12-27 05:55:57,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-27 05:55:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-27 05:55:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-27 05:55:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-27 05:55:58,203 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-27 05:55:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:58,204 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-27 05:55:58,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-27 05:55:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:55:58,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:58,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:58,208 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:58,209 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-27 05:55:58,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:58,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158317912] [2019-12-27 05:55:58,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:58,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158317912] [2019-12-27 05:55:58,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:58,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:58,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628172775] [2019-12-27 05:55:58,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:55:58,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:58,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:55:58,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:55:58,296 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-27 05:55:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:58,987 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-27 05:55:58,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:55:58,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:55:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:59,082 INFO L225 Difference]: With dead ends: 48927 [2019-12-27 05:55:59,082 INFO L226 Difference]: Without dead ends: 48927 [2019-12-27 05:55:59,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-27 05:55:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-27 05:55:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-27 05:55:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-27 05:55:59,909 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-27 05:55:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:59,909 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-27 05:55:59,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:55:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-27 05:55:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:55:59,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:59,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:59,913 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-27 05:55:59,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:59,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005771510] [2019-12-27 05:55:59,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:00,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005771510] [2019-12-27 05:56:00,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:00,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:56:00,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344880049] [2019-12-27 05:56:00,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:56:00,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:00,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:56:00,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:56:00,026 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-27 05:56:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:00,380 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-27 05:56:00,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:56:00,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:56:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:00,465 INFO L225 Difference]: With dead ends: 53251 [2019-12-27 05:56:00,465 INFO L226 Difference]: Without dead ends: 53251 [2019-12-27 05:56:00,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-27 05:56:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-27 05:56:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-27 05:56:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-27 05:56:01,283 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-27 05:56:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:01,283 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-27 05:56:01,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:56:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-27 05:56:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:56:01,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:01,292 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] [2019-12-27 05:56:01,293 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-27 05:56:01,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:01,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603107493] [2019-12-27 05:56:01,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:01,808 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-12-27 05:56:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:01,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603107493] [2019-12-27 05:56:01,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:01,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:56:01,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073697406] [2019-12-27 05:56:01,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:56:01,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:01,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:56:01,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:01,812 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 5 states. [2019-12-27 05:56:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:02,520 INFO L93 Difference]: Finished difference Result 63192 states and 200300 transitions. [2019-12-27 05:56:02,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:56:02,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:56:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:02,627 INFO L225 Difference]: With dead ends: 63192 [2019-12-27 05:56:02,627 INFO L226 Difference]: Without dead ends: 63185 [2019-12-27 05:56:02,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:56:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63185 states. [2019-12-27 05:56:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63185 to 47511. [2019-12-27 05:56:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47511 states. [2019-12-27 05:56:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47511 states to 47511 states and 154018 transitions. [2019-12-27 05:56:03,538 INFO L78 Accepts]: Start accepts. Automaton has 47511 states and 154018 transitions. Word has length 22 [2019-12-27 05:56:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:03,539 INFO L462 AbstractCegarLoop]: Abstraction has 47511 states and 154018 transitions. [2019-12-27 05:56:03,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:56:03,539 INFO L276 IsEmpty]: Start isEmpty. Operand 47511 states and 154018 transitions. [2019-12-27 05:56:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:56:03,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:03,548 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] [2019-12-27 05:56:03,549 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-27 05:56:03,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:03,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563815932] [2019-12-27 05:56:03,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:03,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563815932] [2019-12-27 05:56:03,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:03,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:56:03,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255366598] [2019-12-27 05:56:03,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:56:03,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:03,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:56:03,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:03,645 INFO L87 Difference]: Start difference. First operand 47511 states and 154018 transitions. Second operand 5 states. [2019-12-27 05:56:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:04,273 INFO L93 Difference]: Finished difference Result 65538 states and 207239 transitions. [2019-12-27 05:56:04,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:56:04,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:56:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:04,380 INFO L225 Difference]: With dead ends: 65538 [2019-12-27 05:56:04,381 INFO L226 Difference]: Without dead ends: 65531 [2019-12-27 05:56:04,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:56:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65531 states. [2019-12-27 05:56:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65531 to 45771. [2019-12-27 05:56:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45771 states. [2019-12-27 05:56:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45771 states to 45771 states and 148366 transitions. [2019-12-27 05:56:05,684 INFO L78 Accepts]: Start accepts. Automaton has 45771 states and 148366 transitions. Word has length 22 [2019-12-27 05:56:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:05,685 INFO L462 AbstractCegarLoop]: Abstraction has 45771 states and 148366 transitions. [2019-12-27 05:56:05,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:56:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 45771 states and 148366 transitions. [2019-12-27 05:56:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:56:05,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:05,696 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-27 05:56:05,696 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:05,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:05,697 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-27 05:56:05,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:05,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073667183] [2019-12-27 05:56:05,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:05,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073667183] [2019-12-27 05:56:05,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:05,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:56:05,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765038172] [2019-12-27 05:56:05,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:56:05,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:05,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:56:05,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:56:05,749 INFO L87 Difference]: Start difference. First operand 45771 states and 148366 transitions. Second operand 4 states. [2019-12-27 05:56:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:05,839 INFO L93 Difference]: Finished difference Result 17755 states and 54382 transitions. [2019-12-27 05:56:05,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:56:05,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:56:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:05,871 INFO L225 Difference]: With dead ends: 17755 [2019-12-27 05:56:05,871 INFO L226 Difference]: Without dead ends: 17755 [2019-12-27 05:56:05,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:56:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17755 states. [2019-12-27 05:56:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17755 to 17427. [2019-12-27 05:56:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17427 states. [2019-12-27 05:56:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17427 states to 17427 states and 53446 transitions. [2019-12-27 05:56:06,125 INFO L78 Accepts]: Start accepts. Automaton has 17427 states and 53446 transitions. Word has length 25 [2019-12-27 05:56:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:06,125 INFO L462 AbstractCegarLoop]: Abstraction has 17427 states and 53446 transitions. [2019-12-27 05:56:06,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:56:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 17427 states and 53446 transitions. [2019-12-27 05:56:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:56:06,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:06,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:06,139 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:06,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-27 05:56:06,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:06,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026683768] [2019-12-27 05:56:06,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:06,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026683768] [2019-12-27 05:56:06,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:06,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:56:06,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784690075] [2019-12-27 05:56:06,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:56:06,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:56:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:06,221 INFO L87 Difference]: Start difference. First operand 17427 states and 53446 transitions. Second operand 5 states. [2019-12-27 05:56:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:06,631 INFO L93 Difference]: Finished difference Result 22078 states and 66584 transitions. [2019-12-27 05:56:06,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:56:06,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 05:56:06,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:06,670 INFO L225 Difference]: With dead ends: 22078 [2019-12-27 05:56:06,670 INFO L226 Difference]: Without dead ends: 22078 [2019-12-27 05:56:06,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:56:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22078 states. [2019-12-27 05:56:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22078 to 20690. [2019-12-27 05:56:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20690 states. [2019-12-27 05:56:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 63094 transitions. [2019-12-27 05:56:07,027 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 63094 transitions. Word has length 27 [2019-12-27 05:56:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:07,027 INFO L462 AbstractCegarLoop]: Abstraction has 20690 states and 63094 transitions. [2019-12-27 05:56:07,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:56:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 63094 transitions. [2019-12-27 05:56:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:56:07,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:07,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:07,042 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:07,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:07,043 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-27 05:56:07,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:07,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895000376] [2019-12-27 05:56:07,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:07,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895000376] [2019-12-27 05:56:07,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:07,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:56:07,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250571310] [2019-12-27 05:56:07,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:56:07,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:07,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:56:07,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:07,123 INFO L87 Difference]: Start difference. First operand 20690 states and 63094 transitions. Second operand 5 states. [2019-12-27 05:56:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:07,236 INFO L93 Difference]: Finished difference Result 21192 states and 64429 transitions. [2019-12-27 05:56:07,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:56:07,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:56:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:07,274 INFO L225 Difference]: With dead ends: 21192 [2019-12-27 05:56:07,274 INFO L226 Difference]: Without dead ends: 21192 [2019-12-27 05:56:07,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21192 states. [2019-12-27 05:56:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21192 to 21192. [2019-12-27 05:56:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21192 states. [2019-12-27 05:56:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21192 states to 21192 states and 64429 transitions. [2019-12-27 05:56:07,564 INFO L78 Accepts]: Start accepts. Automaton has 21192 states and 64429 transitions. Word has length 28 [2019-12-27 05:56:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:07,565 INFO L462 AbstractCegarLoop]: Abstraction has 21192 states and 64429 transitions. [2019-12-27 05:56:07,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:56:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 21192 states and 64429 transitions. [2019-12-27 05:56:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 05:56:07,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:07,580 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] [2019-12-27 05:56:07,580 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-27 05:56:07,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:07,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511924269] [2019-12-27 05:56:07,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:07,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511924269] [2019-12-27 05:56:07,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:07,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:56:07,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026946445] [2019-12-27 05:56:07,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:56:07,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:56:07,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:07,665 INFO L87 Difference]: Start difference. First operand 21192 states and 64429 transitions. Second operand 5 states. [2019-12-27 05:56:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:08,047 INFO L93 Difference]: Finished difference Result 24492 states and 73342 transitions. [2019-12-27 05:56:08,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:56:08,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 05:56:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:08,092 INFO L225 Difference]: With dead ends: 24492 [2019-12-27 05:56:08,092 INFO L226 Difference]: Without dead ends: 24492 [2019-12-27 05:56:08,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:56:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24492 states. [2019-12-27 05:56:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24492 to 20516. [2019-12-27 05:56:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-27 05:56:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 62500 transitions. [2019-12-27 05:56:08,635 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 62500 transitions. Word has length 29 [2019-12-27 05:56:08,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:08,635 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 62500 transitions. [2019-12-27 05:56:08,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:56:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 62500 transitions. [2019-12-27 05:56:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:56:08,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:08,655 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] [2019-12-27 05:56:08,655 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:08,656 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-27 05:56:08,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:08,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125910167] [2019-12-27 05:56:08,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:08,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125910167] [2019-12-27 05:56:08,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:08,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:56:08,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818687082] [2019-12-27 05:56:08,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:56:08,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:08,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:56:08,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:56:08,753 INFO L87 Difference]: Start difference. First operand 20516 states and 62500 transitions. Second operand 6 states. [2019-12-27 05:56:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:09,421 INFO L93 Difference]: Finished difference Result 27891 states and 82809 transitions. [2019-12-27 05:56:09,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:56:09,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 05:56:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:09,459 INFO L225 Difference]: With dead ends: 27891 [2019-12-27 05:56:09,460 INFO L226 Difference]: Without dead ends: 27891 [2019-12-27 05:56:09,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:56:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27891 states. [2019-12-27 05:56:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27891 to 21560. [2019-12-27 05:56:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21560 states. [2019-12-27 05:56:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21560 states to 21560 states and 65334 transitions. [2019-12-27 05:56:09,805 INFO L78 Accepts]: Start accepts. Automaton has 21560 states and 65334 transitions. Word has length 33 [2019-12-27 05:56:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:09,805 INFO L462 AbstractCegarLoop]: Abstraction has 21560 states and 65334 transitions. [2019-12-27 05:56:09,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:56:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 21560 states and 65334 transitions. [2019-12-27 05:56:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 05:56:09,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:09,822 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] [2019-12-27 05:56:09,823 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:09,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-27 05:56:09,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:09,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556800979] [2019-12-27 05:56:09,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:09,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556800979] [2019-12-27 05:56:09,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:09,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:56:09,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205246491] [2019-12-27 05:56:09,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:56:09,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:56:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:56:09,922 INFO L87 Difference]: Start difference. First operand 21560 states and 65334 transitions. Second operand 6 states. [2019-12-27 05:56:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:10,600 INFO L93 Difference]: Finished difference Result 27170 states and 81035 transitions. [2019-12-27 05:56:10,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:56:10,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 05:56:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:10,639 INFO L225 Difference]: With dead ends: 27170 [2019-12-27 05:56:10,639 INFO L226 Difference]: Without dead ends: 27170 [2019-12-27 05:56:10,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:56:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27170 states. [2019-12-27 05:56:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27170 to 18453. [2019-12-27 05:56:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18453 states. [2019-12-27 05:56:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18453 states to 18453 states and 56474 transitions. [2019-12-27 05:56:10,986 INFO L78 Accepts]: Start accepts. Automaton has 18453 states and 56474 transitions. Word has length 35 [2019-12-27 05:56:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:10,986 INFO L462 AbstractCegarLoop]: Abstraction has 18453 states and 56474 transitions. [2019-12-27 05:56:10,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:56:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18453 states and 56474 transitions. [2019-12-27 05:56:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:56:11,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:11,006 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] [2019-12-27 05:56:11,006 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-27 05:56:11,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:11,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451606039] [2019-12-27 05:56:11,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:11,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451606039] [2019-12-27 05:56:11,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:11,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:56:11,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631662825] [2019-12-27 05:56:11,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:56:11,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:11,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:56:11,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:11,070 INFO L87 Difference]: Start difference. First operand 18453 states and 56474 transitions. Second operand 3 states. [2019-12-27 05:56:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:11,222 INFO L93 Difference]: Finished difference Result 34876 states and 106833 transitions. [2019-12-27 05:56:11,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:56:11,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:56:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:11,258 INFO L225 Difference]: With dead ends: 34876 [2019-12-27 05:56:11,258 INFO L226 Difference]: Without dead ends: 18951 [2019-12-27 05:56:11,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18951 states. [2019-12-27 05:56:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18951 to 18887. [2019-12-27 05:56:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18887 states. [2019-12-27 05:56:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18887 states to 18887 states and 56346 transitions. [2019-12-27 05:56:11,549 INFO L78 Accepts]: Start accepts. Automaton has 18887 states and 56346 transitions. Word has length 39 [2019-12-27 05:56:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:11,549 INFO L462 AbstractCegarLoop]: Abstraction has 18887 states and 56346 transitions. [2019-12-27 05:56:11,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:56:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 18887 states and 56346 transitions. [2019-12-27 05:56:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:56:11,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:11,569 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] [2019-12-27 05:56:11,569 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-27 05:56:11,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:11,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850757326] [2019-12-27 05:56:11,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:11,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850757326] [2019-12-27 05:56:11,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:11,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:56:11,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004858093] [2019-12-27 05:56:11,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:56:11,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:11,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:56:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:11,643 INFO L87 Difference]: Start difference. First operand 18887 states and 56346 transitions. Second operand 5 states. [2019-12-27 05:56:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:12,200 INFO L93 Difference]: Finished difference Result 26904 states and 79492 transitions. [2019-12-27 05:56:12,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:56:12,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:56:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:12,237 INFO L225 Difference]: With dead ends: 26904 [2019-12-27 05:56:12,237 INFO L226 Difference]: Without dead ends: 26904 [2019-12-27 05:56:12,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:56:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26904 states. [2019-12-27 05:56:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26904 to 24978. [2019-12-27 05:56:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24978 states. [2019-12-27 05:56:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24978 states to 24978 states and 74337 transitions. [2019-12-27 05:56:12,805 INFO L78 Accepts]: Start accepts. Automaton has 24978 states and 74337 transitions. Word has length 40 [2019-12-27 05:56:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:12,805 INFO L462 AbstractCegarLoop]: Abstraction has 24978 states and 74337 transitions. [2019-12-27 05:56:12,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:56:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24978 states and 74337 transitions. [2019-12-27 05:56:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:56:12,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:12,837 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] [2019-12-27 05:56:12,837 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-27 05:56:12,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:12,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643317487] [2019-12-27 05:56:12,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:12,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643317487] [2019-12-27 05:56:12,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:12,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:56:12,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955057086] [2019-12-27 05:56:12,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:56:12,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:56:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:12,891 INFO L87 Difference]: Start difference. First operand 24978 states and 74337 transitions. Second operand 5 states. [2019-12-27 05:56:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:12,990 INFO L93 Difference]: Finished difference Result 23522 states and 70969 transitions. [2019-12-27 05:56:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:56:12,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:56:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:13,019 INFO L225 Difference]: With dead ends: 23522 [2019-12-27 05:56:13,020 INFO L226 Difference]: Without dead ends: 21728 [2019-12-27 05:56:13,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:56:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21728 states. [2019-12-27 05:56:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21728 to 20804. [2019-12-27 05:56:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20804 states. [2019-12-27 05:56:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20804 states to 20804 states and 64576 transitions. [2019-12-27 05:56:13,339 INFO L78 Accepts]: Start accepts. Automaton has 20804 states and 64576 transitions. Word has length 40 [2019-12-27 05:56:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:13,339 INFO L462 AbstractCegarLoop]: Abstraction has 20804 states and 64576 transitions. [2019-12-27 05:56:13,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:56:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 20804 states and 64576 transitions. [2019-12-27 05:56:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:56:13,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:13,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:13,361 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:13,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:13,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1469321779, now seen corresponding path program 1 times [2019-12-27 05:56:13,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:13,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720559539] [2019-12-27 05:56:13,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:13,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720559539] [2019-12-27 05:56:13,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:13,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:56:13,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364938765] [2019-12-27 05:56:13,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:56:13,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:56:13,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:56:13,454 INFO L87 Difference]: Start difference. First operand 20804 states and 64576 transitions. Second operand 7 states. [2019-12-27 05:56:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:14,003 INFO L93 Difference]: Finished difference Result 64056 states and 197500 transitions. [2019-12-27 05:56:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 05:56:14,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:56:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:14,071 INFO L225 Difference]: With dead ends: 64056 [2019-12-27 05:56:14,071 INFO L226 Difference]: Without dead ends: 47946 [2019-12-27 05:56:14,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:56:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47946 states. [2019-12-27 05:56:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47946 to 24293. [2019-12-27 05:56:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24293 states. [2019-12-27 05:56:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24293 states to 24293 states and 75873 transitions. [2019-12-27 05:56:14,605 INFO L78 Accepts]: Start accepts. Automaton has 24293 states and 75873 transitions. Word has length 64 [2019-12-27 05:56:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:14,605 INFO L462 AbstractCegarLoop]: Abstraction has 24293 states and 75873 transitions. [2019-12-27 05:56:14,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:56:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 24293 states and 75873 transitions. [2019-12-27 05:56:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:56:14,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:14,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:14,628 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash 572317973, now seen corresponding path program 2 times [2019-12-27 05:56:14,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:14,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267068162] [2019-12-27 05:56:14,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:14,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267068162] [2019-12-27 05:56:14,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:14,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:56:14,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717935388] [2019-12-27 05:56:14,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:56:14,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:14,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:56:14,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:56:14,706 INFO L87 Difference]: Start difference. First operand 24293 states and 75873 transitions. Second operand 7 states. [2019-12-27 05:56:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:15,239 INFO L93 Difference]: Finished difference Result 68097 states and 208875 transitions. [2019-12-27 05:56:15,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:56:15,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:56:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:15,306 INFO L225 Difference]: With dead ends: 68097 [2019-12-27 05:56:15,306 INFO L226 Difference]: Without dead ends: 47219 [2019-12-27 05:56:15,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:56:15,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47219 states. [2019-12-27 05:56:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47219 to 27552. [2019-12-27 05:56:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27552 states. [2019-12-27 05:56:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27552 states to 27552 states and 85874 transitions. [2019-12-27 05:56:15,874 INFO L78 Accepts]: Start accepts. Automaton has 27552 states and 85874 transitions. Word has length 64 [2019-12-27 05:56:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:15,874 INFO L462 AbstractCegarLoop]: Abstraction has 27552 states and 85874 transitions. [2019-12-27 05:56:15,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:56:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 27552 states and 85874 transitions. [2019-12-27 05:56:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:56:16,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:16,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:16,144 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash 584356249, now seen corresponding path program 3 times [2019-12-27 05:56:16,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:16,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890920292] [2019-12-27 05:56:16,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:16,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890920292] [2019-12-27 05:56:16,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:16,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:56:16,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139885671] [2019-12-27 05:56:16,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:56:16,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:16,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:56:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:56:16,231 INFO L87 Difference]: Start difference. First operand 27552 states and 85874 transitions. Second operand 7 states. [2019-12-27 05:56:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:16,710 INFO L93 Difference]: Finished difference Result 59727 states and 183443 transitions. [2019-12-27 05:56:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:56:16,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:56:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:16,791 INFO L225 Difference]: With dead ends: 59727 [2019-12-27 05:56:16,791 INFO L226 Difference]: Without dead ends: 52169 [2019-12-27 05:56:16,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:56:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52169 states. [2019-12-27 05:56:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52169 to 27860. [2019-12-27 05:56:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27860 states. [2019-12-27 05:56:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27860 states to 27860 states and 86825 transitions. [2019-12-27 05:56:17,404 INFO L78 Accepts]: Start accepts. Automaton has 27860 states and 86825 transitions. Word has length 64 [2019-12-27 05:56:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:17,405 INFO L462 AbstractCegarLoop]: Abstraction has 27860 states and 86825 transitions. [2019-12-27 05:56:17,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:56:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 27860 states and 86825 transitions. [2019-12-27 05:56:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:56:17,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:17,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:17,436 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:17,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:17,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1340586405, now seen corresponding path program 4 times [2019-12-27 05:56:17,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:17,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898641002] [2019-12-27 05:56:17,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:17,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898641002] [2019-12-27 05:56:17,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:17,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:56:17,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346980443] [2019-12-27 05:56:17,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:56:17,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:17,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:56:17,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:17,495 INFO L87 Difference]: Start difference. First operand 27860 states and 86825 transitions. Second operand 3 states. [2019-12-27 05:56:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:17,704 INFO L93 Difference]: Finished difference Result 33798 states and 103981 transitions. [2019-12-27 05:56:17,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:56:17,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:56:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:17,782 INFO L225 Difference]: With dead ends: 33798 [2019-12-27 05:56:17,782 INFO L226 Difference]: Without dead ends: 33798 [2019-12-27 05:56:17,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:17,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33798 states. [2019-12-27 05:56:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33798 to 29485. [2019-12-27 05:56:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29485 states. [2019-12-27 05:56:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29485 states to 29485 states and 91533 transitions. [2019-12-27 05:56:18,368 INFO L78 Accepts]: Start accepts. Automaton has 29485 states and 91533 transitions. Word has length 64 [2019-12-27 05:56:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:18,368 INFO L462 AbstractCegarLoop]: Abstraction has 29485 states and 91533 transitions. [2019-12-27 05:56:18,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:56:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 29485 states and 91533 transitions. [2019-12-27 05:56:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:18,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:18,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:18,397 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:18,398 INFO L82 PathProgramCache]: Analyzing trace with hash -87540519, now seen corresponding path program 1 times [2019-12-27 05:56:18,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:18,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620026875] [2019-12-27 05:56:18,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:18,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620026875] [2019-12-27 05:56:18,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:18,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:56:18,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572946255] [2019-12-27 05:56:18,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:56:18,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:18,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:56:18,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:56:18,617 INFO L87 Difference]: Start difference. First operand 29485 states and 91533 transitions. Second operand 12 states. [2019-12-27 05:56:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:22,788 INFO L93 Difference]: Finished difference Result 57603 states and 174131 transitions. [2019-12-27 05:56:22,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 05:56:22,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 05:56:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:22,867 INFO L225 Difference]: With dead ends: 57603 [2019-12-27 05:56:22,868 INFO L226 Difference]: Without dead ends: 57202 [2019-12-27 05:56:22,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1579, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 05:56:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57202 states. [2019-12-27 05:56:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57202 to 35245. [2019-12-27 05:56:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35245 states. [2019-12-27 05:56:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35245 states to 35245 states and 108680 transitions. [2019-12-27 05:56:23,557 INFO L78 Accepts]: Start accepts. Automaton has 35245 states and 108680 transitions. Word has length 65 [2019-12-27 05:56:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:23,557 INFO L462 AbstractCegarLoop]: Abstraction has 35245 states and 108680 transitions. [2019-12-27 05:56:23,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:56:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 35245 states and 108680 transitions. [2019-12-27 05:56:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:23,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:23,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:23,594 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:23,594 INFO L82 PathProgramCache]: Analyzing trace with hash -801818747, now seen corresponding path program 2 times [2019-12-27 05:56:23,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:23,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217641718] [2019-12-27 05:56:23,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:23,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217641718] [2019-12-27 05:56:23,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:23,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:56:23,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051120992] [2019-12-27 05:56:23,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:56:23,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:56:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:56:23,801 INFO L87 Difference]: Start difference. First operand 35245 states and 108680 transitions. Second operand 10 states. [2019-12-27 05:56:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:25,724 INFO L93 Difference]: Finished difference Result 57712 states and 175433 transitions. [2019-12-27 05:56:25,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:56:25,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 05:56:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:25,807 INFO L225 Difference]: With dead ends: 57712 [2019-12-27 05:56:25,807 INFO L226 Difference]: Without dead ends: 57492 [2019-12-27 05:56:25,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:56:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57492 states. [2019-12-27 05:56:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57492 to 41970. [2019-12-27 05:56:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41970 states. [2019-12-27 05:56:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41970 states to 41970 states and 129184 transitions. [2019-12-27 05:56:26,557 INFO L78 Accepts]: Start accepts. Automaton has 41970 states and 129184 transitions. Word has length 65 [2019-12-27 05:56:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:26,557 INFO L462 AbstractCegarLoop]: Abstraction has 41970 states and 129184 transitions. [2019-12-27 05:56:26,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:56:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 41970 states and 129184 transitions. [2019-12-27 05:56:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:26,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:26,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:26,600 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:26,601 INFO L82 PathProgramCache]: Analyzing trace with hash 69716979, now seen corresponding path program 3 times [2019-12-27 05:56:26,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:26,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604102500] [2019-12-27 05:56:26,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:26,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604102500] [2019-12-27 05:56:26,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:26,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:56:26,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805999401] [2019-12-27 05:56:26,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:56:26,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:56:26,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:56:26,796 INFO L87 Difference]: Start difference. First operand 41970 states and 129184 transitions. Second operand 10 states. [2019-12-27 05:56:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:29,161 INFO L93 Difference]: Finished difference Result 61239 states and 184994 transitions. [2019-12-27 05:56:29,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 05:56:29,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 05:56:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:29,248 INFO L225 Difference]: With dead ends: 61239 [2019-12-27 05:56:29,248 INFO L226 Difference]: Without dead ends: 60987 [2019-12-27 05:56:29,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-27 05:56:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60987 states. [2019-12-27 05:56:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60987 to 41551. [2019-12-27 05:56:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41551 states. [2019-12-27 05:56:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41551 states to 41551 states and 127968 transitions. [2019-12-27 05:56:30,022 INFO L78 Accepts]: Start accepts. Automaton has 41551 states and 127968 transitions. Word has length 65 [2019-12-27 05:56:30,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:30,023 INFO L462 AbstractCegarLoop]: Abstraction has 41551 states and 127968 transitions. [2019-12-27 05:56:30,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:56:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 41551 states and 127968 transitions. [2019-12-27 05:56:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:30,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:30,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:30,065 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash -417114903, now seen corresponding path program 4 times [2019-12-27 05:56:30,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:30,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433775509] [2019-12-27 05:56:30,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:30,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433775509] [2019-12-27 05:56:30,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:30,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:56:30,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666156419] [2019-12-27 05:56:30,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:56:30,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:56:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:30,119 INFO L87 Difference]: Start difference. First operand 41551 states and 127968 transitions. Second operand 3 states. [2019-12-27 05:56:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:30,292 INFO L93 Difference]: Finished difference Result 41550 states and 127966 transitions. [2019-12-27 05:56:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:56:30,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:56:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:30,361 INFO L225 Difference]: With dead ends: 41550 [2019-12-27 05:56:30,361 INFO L226 Difference]: Without dead ends: 41550 [2019-12-27 05:56:30,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41550 states. [2019-12-27 05:56:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41550 to 33202. [2019-12-27 05:56:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33202 states. [2019-12-27 05:56:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33202 states to 33202 states and 103913 transitions. [2019-12-27 05:56:30,951 INFO L78 Accepts]: Start accepts. Automaton has 33202 states and 103913 transitions. Word has length 65 [2019-12-27 05:56:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:30,951 INFO L462 AbstractCegarLoop]: Abstraction has 33202 states and 103913 transitions. [2019-12-27 05:56:30,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:56:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 33202 states and 103913 transitions. [2019-12-27 05:56:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:56:30,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:30,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:30,986 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:30,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:30,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2032409417, now seen corresponding path program 1 times [2019-12-27 05:56:30,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:30,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72999544] [2019-12-27 05:56:30,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:31,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72999544] [2019-12-27 05:56:31,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:31,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:56:31,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45290619] [2019-12-27 05:56:31,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:56:31,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:31,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:56:31,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:31,052 INFO L87 Difference]: Start difference. First operand 33202 states and 103913 transitions. Second operand 3 states. [2019-12-27 05:56:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:31,162 INFO L93 Difference]: Finished difference Result 24930 states and 76774 transitions. [2019-12-27 05:56:31,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:56:31,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:56:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:31,207 INFO L225 Difference]: With dead ends: 24930 [2019-12-27 05:56:31,208 INFO L226 Difference]: Without dead ends: 24930 [2019-12-27 05:56:31,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24930 states. [2019-12-27 05:56:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24930 to 23789. [2019-12-27 05:56:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23789 states. [2019-12-27 05:56:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23789 states to 23789 states and 73181 transitions. [2019-12-27 05:56:31,748 INFO L78 Accepts]: Start accepts. Automaton has 23789 states and 73181 transitions. Word has length 66 [2019-12-27 05:56:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:31,748 INFO L462 AbstractCegarLoop]: Abstraction has 23789 states and 73181 transitions. [2019-12-27 05:56:31,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:56:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 23789 states and 73181 transitions. [2019-12-27 05:56:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:31,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:31,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:31,773 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:31,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:31,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1309527475, now seen corresponding path program 1 times [2019-12-27 05:56:31,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:31,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891594044] [2019-12-27 05:56:31,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:31,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891594044] [2019-12-27 05:56:31,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:31,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:56:31,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721585494] [2019-12-27 05:56:31,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:56:31,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:31,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:56:31,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:56:31,985 INFO L87 Difference]: Start difference. First operand 23789 states and 73181 transitions. Second operand 11 states. [2019-12-27 05:56:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:33,188 INFO L93 Difference]: Finished difference Result 52764 states and 162666 transitions. [2019-12-27 05:56:33,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 05:56:33,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:56:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:33,257 INFO L225 Difference]: With dead ends: 52764 [2019-12-27 05:56:33,257 INFO L226 Difference]: Without dead ends: 49825 [2019-12-27 05:56:33,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 05:56:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49825 states. [2019-12-27 05:56:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49825 to 29317. [2019-12-27 05:56:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29317 states. [2019-12-27 05:56:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29317 states to 29317 states and 90443 transitions. [2019-12-27 05:56:33,856 INFO L78 Accepts]: Start accepts. Automaton has 29317 states and 90443 transitions. Word has length 67 [2019-12-27 05:56:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:33,856 INFO L462 AbstractCegarLoop]: Abstraction has 29317 states and 90443 transitions. [2019-12-27 05:56:33,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:56:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 29317 states and 90443 transitions. [2019-12-27 05:56:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:33,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:33,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:33,887 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1955892329, now seen corresponding path program 2 times [2019-12-27 05:56:33,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:33,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739164075] [2019-12-27 05:56:33,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:34,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739164075] [2019-12-27 05:56:34,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:34,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:56:34,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696254983] [2019-12-27 05:56:34,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:56:34,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:56:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:56:34,263 INFO L87 Difference]: Start difference. First operand 29317 states and 90443 transitions. Second operand 15 states. [2019-12-27 05:56:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:38,500 INFO L93 Difference]: Finished difference Result 62806 states and 190755 transitions. [2019-12-27 05:56:38,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 05:56:38,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 05:56:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:38,589 INFO L225 Difference]: With dead ends: 62806 [2019-12-27 05:56:38,589 INFO L226 Difference]: Without dead ends: 56189 [2019-12-27 05:56:38,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=393, Invalid=1769, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 05:56:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56189 states. [2019-12-27 05:56:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56189 to 29805. [2019-12-27 05:56:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29805 states. [2019-12-27 05:56:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29805 states to 29805 states and 91663 transitions. [2019-12-27 05:56:39,473 INFO L78 Accepts]: Start accepts. Automaton has 29805 states and 91663 transitions. Word has length 67 [2019-12-27 05:56:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:39,473 INFO L462 AbstractCegarLoop]: Abstraction has 29805 states and 91663 transitions. [2019-12-27 05:56:39,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:56:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 29805 states and 91663 transitions. [2019-12-27 05:56:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:39,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:39,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:39,506 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash -886085509, now seen corresponding path program 3 times [2019-12-27 05:56:39,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:39,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815058352] [2019-12-27 05:56:39,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:39,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815058352] [2019-12-27 05:56:39,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:39,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:56:39,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216498062] [2019-12-27 05:56:39,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:56:39,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:39,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:56:39,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:56:39,909 INFO L87 Difference]: Start difference. First operand 29805 states and 91663 transitions. Second operand 16 states. [2019-12-27 05:56:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:45,491 INFO L93 Difference]: Finished difference Result 64941 states and 197232 transitions. [2019-12-27 05:56:45,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 05:56:45,491 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 05:56:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:45,573 INFO L225 Difference]: With dead ends: 64941 [2019-12-27 05:56:45,573 INFO L226 Difference]: Without dead ends: 51877 [2019-12-27 05:56:45,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=607, Invalid=2933, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 05:56:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51877 states. [2019-12-27 05:56:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51877 to 28708. [2019-12-27 05:56:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28708 states. [2019-12-27 05:56:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28708 states to 28708 states and 88070 transitions. [2019-12-27 05:56:46,180 INFO L78 Accepts]: Start accepts. Automaton has 28708 states and 88070 transitions. Word has length 67 [2019-12-27 05:56:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:46,181 INFO L462 AbstractCegarLoop]: Abstraction has 28708 states and 88070 transitions. [2019-12-27 05:56:46,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:56:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 28708 states and 88070 transitions. [2019-12-27 05:56:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:46,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:46,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:46,212 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 108197429, now seen corresponding path program 4 times [2019-12-27 05:56:46,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:46,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114094192] [2019-12-27 05:56:46,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:46,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114094192] [2019-12-27 05:56:46,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:46,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:56:46,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623967686] [2019-12-27 05:56:46,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:56:46,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:46,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:56:46,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:56:46,380 INFO L87 Difference]: Start difference. First operand 28708 states and 88070 transitions. Second operand 11 states. [2019-12-27 05:56:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:47,520 INFO L93 Difference]: Finished difference Result 47682 states and 145359 transitions. [2019-12-27 05:56:47,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:56:47,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:56:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:47,575 INFO L225 Difference]: With dead ends: 47682 [2019-12-27 05:56:47,575 INFO L226 Difference]: Without dead ends: 40000 [2019-12-27 05:56:47,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:56:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40000 states. [2019-12-27 05:56:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40000 to 23709. [2019-12-27 05:56:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23709 states. [2019-12-27 05:56:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23709 states to 23709 states and 72247 transitions. [2019-12-27 05:56:48,030 INFO L78 Accepts]: Start accepts. Automaton has 23709 states and 72247 transitions. Word has length 67 [2019-12-27 05:56:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:48,030 INFO L462 AbstractCegarLoop]: Abstraction has 23709 states and 72247 transitions. [2019-12-27 05:56:48,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:56:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23709 states and 72247 transitions. [2019-12-27 05:56:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:48,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:48,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:48,052 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:48,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:48,052 INFO L82 PathProgramCache]: Analyzing trace with hash -673154253, now seen corresponding path program 5 times [2019-12-27 05:56:48,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:48,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427034163] [2019-12-27 05:56:48,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:48,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427034163] [2019-12-27 05:56:48,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:48,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:56:48,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026069419] [2019-12-27 05:56:48,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:56:48,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:48,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:56:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:56:48,578 INFO L87 Difference]: Start difference. First operand 23709 states and 72247 transitions. Second operand 16 states. [2019-12-27 05:56:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:51,953 INFO L93 Difference]: Finished difference Result 43416 states and 130709 transitions. [2019-12-27 05:56:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 05:56:51,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 05:56:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:52,012 INFO L225 Difference]: With dead ends: 43416 [2019-12-27 05:56:52,012 INFO L226 Difference]: Without dead ends: 42661 [2019-12-27 05:56:52,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=426, Invalid=2226, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 05:56:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42661 states. [2019-12-27 05:56:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42661 to 23631. [2019-12-27 05:56:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23631 states. [2019-12-27 05:56:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23631 states to 23631 states and 72043 transitions. [2019-12-27 05:56:52,499 INFO L78 Accepts]: Start accepts. Automaton has 23631 states and 72043 transitions. Word has length 67 [2019-12-27 05:56:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:52,499 INFO L462 AbstractCegarLoop]: Abstraction has 23631 states and 72043 transitions. [2019-12-27 05:56:52,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:56:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 23631 states and 72043 transitions. [2019-12-27 05:56:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:52,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:52,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:52,526 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1670572367, now seen corresponding path program 6 times [2019-12-27 05:56:52,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:52,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467597931] [2019-12-27 05:56:52,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:52,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467597931] [2019-12-27 05:56:52,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:52,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:56:52,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296780374] [2019-12-27 05:56:52,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:56:52,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:56:52,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:56:52,677 INFO L87 Difference]: Start difference. First operand 23631 states and 72043 transitions. Second operand 12 states. [2019-12-27 05:56:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:53,612 INFO L93 Difference]: Finished difference Result 40408 states and 122580 transitions. [2019-12-27 05:56:53,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:56:53,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 05:56:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:53,666 INFO L225 Difference]: With dead ends: 40408 [2019-12-27 05:56:53,666 INFO L226 Difference]: Without dead ends: 39484 [2019-12-27 05:56:53,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:56:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39484 states. [2019-12-27 05:56:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39484 to 23047. [2019-12-27 05:56:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23047 states. [2019-12-27 05:56:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23047 states to 23047 states and 70426 transitions. [2019-12-27 05:56:54,309 INFO L78 Accepts]: Start accepts. Automaton has 23047 states and 70426 transitions. Word has length 67 [2019-12-27 05:56:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:54,309 INFO L462 AbstractCegarLoop]: Abstraction has 23047 states and 70426 transitions. [2019-12-27 05:56:54,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:56:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 23047 states and 70426 transitions. [2019-12-27 05:56:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:54,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:54,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:54,334 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:54,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:54,334 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 7 times [2019-12-27 05:56:54,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:54,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042901965] [2019-12-27 05:56:54,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:56:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:56:54,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:56:54,440 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:56:54,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t678~0.base_21|) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= (select .cse0 |v_ULTIMATE.start_main_~#t678~0.base_21|) 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (= v_~x~0_10 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$w_buff1_used~0_73) (= v_~y~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t678~0.base_21| 1)) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_ULTIMATE.start_main_~#t678~0.offset_16|) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t678~0.base_21| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_21|) |v_ULTIMATE.start_main_~#t678~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t678~0.offset=|v_ULTIMATE.start_main_~#t678~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_15|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_19|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_20|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ULTIMATE.start_main_~#t678~0.base=|v_ULTIMATE.start_main_~#t678~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t678~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t680~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t680~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t679~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t678~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:56:54,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:56:54,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (not (= |v_ULTIMATE.start_main_~#t679~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11|) |v_ULTIMATE.start_main_~#t679~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t679~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t679~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t679~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t679~0.offset] because there is no mapped edge [2019-12-27 05:56:54,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t680~0.base_12| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12|) |v_ULTIMATE.start_main_~#t680~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t680~0.base_12|) (= |v_ULTIMATE.start_main_~#t680~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t680~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t680~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t680~0.base] because there is no mapped edge [2019-12-27 05:56:54,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-898522060 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-898522060 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-898522060| |P1Thread1of1ForFork2_#t~ite10_Out-898522060|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-898522060| ~z~0_In-898522060) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-898522060| ~z$w_buff1~0_In-898522060)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-898522060, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-898522060, ~z$w_buff1~0=~z$w_buff1~0_In-898522060, ~z~0=~z~0_In-898522060} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-898522060|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-898522060, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-898522060|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-898522060, ~z$w_buff1~0=~z$w_buff1~0_In-898522060, ~z~0=~z~0_In-898522060} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:56:54,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1701400437 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1701400437 |P2Thread1of1ForFork0_#t~ite24_Out-1701400437|) (= |P2Thread1of1ForFork0_#t~ite23_In-1701400437| |P2Thread1of1ForFork0_#t~ite23_Out-1701400437|)) (and (= ~z$w_buff1~0_In-1701400437 |P2Thread1of1ForFork0_#t~ite23_Out-1701400437|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1701400437 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1701400437 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1701400437 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1701400437 256)))) (= |P2Thread1of1ForFork0_#t~ite24_Out-1701400437| |P2Thread1of1ForFork0_#t~ite23_Out-1701400437|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701400437, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701400437, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1701400437|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701400437, ~z$w_buff1~0=~z$w_buff1~0_In-1701400437, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701400437, ~weak$$choice2~0=~weak$$choice2~0_In-1701400437} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701400437, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1701400437|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701400437, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1701400437|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701400437, ~z$w_buff1~0=~z$w_buff1~0_In-1701400437, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701400437, ~weak$$choice2~0=~weak$$choice2~0_In-1701400437} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 05:56:54,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse4 (= |P2Thread1of1ForFork0_#t~ite30_Out-211845818| |P2Thread1of1ForFork0_#t~ite29_Out-211845818|)) (.cse5 (= 0 (mod ~z$w_buff0_used~0_In-211845818 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-211845818 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In-211845818 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-211845818 256))) (.cse3 (= 0 (mod ~weak$$choice2~0_In-211845818 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (or .cse1 (not .cse2)) (= |P2Thread1of1ForFork0_#t~ite28_Out-211845818| |P2Thread1of1ForFork0_#t~ite29_Out-211845818|) (= |P2Thread1of1ForFork0_#t~ite28_Out-211845818| 0) .cse3 .cse4 (not .cse5))) (and (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-211845818| ~z$w_buff1_used~0_In-211845818) .cse3 .cse4 (or .cse5 (and .cse2 .cse6) (and .cse6 .cse0))) (and (= |P2Thread1of1ForFork0_#t~ite29_In-211845818| |P2Thread1of1ForFork0_#t~ite29_Out-211845818|) (not .cse3) (= |P2Thread1of1ForFork0_#t~ite30_Out-211845818| ~z$w_buff1_used~0_In-211845818))) (= |P2Thread1of1ForFork0_#t~ite28_In-211845818| |P2Thread1of1ForFork0_#t~ite28_Out-211845818|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-211845818|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-211845818, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-211845818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211845818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-211845818, ~weak$$choice2~0=~weak$$choice2~0_In-211845818, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-211845818|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-211845818|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-211845818, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-211845818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211845818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-211845818, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-211845818|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-211845818|, ~weak$$choice2~0=~weak$$choice2~0_In-211845818} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 05:56:54,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:56:54,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 05:56:54,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1631602162 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1631602162 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out1631602162| |P2Thread1of1ForFork0_#t~ite38_Out1631602162|))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In1631602162 |P2Thread1of1ForFork0_#t~ite38_Out1631602162|) (not .cse2)) (and (or .cse2 .cse0) (= ~z~0_In1631602162 |P2Thread1of1ForFork0_#t~ite38_Out1631602162|) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1631602162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1631602162, ~z$w_buff1~0=~z$w_buff1~0_In1631602162, ~z~0=~z~0_In1631602162} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1631602162|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1631602162|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1631602162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1631602162, ~z$w_buff1~0=~z$w_buff1~0_In1631602162, ~z~0=~z~0_In1631602162} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:56:54,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In673202687 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In673202687 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out673202687|)) (and (= ~z$w_buff0_used~0_In673202687 |P2Thread1of1ForFork0_#t~ite40_Out673202687|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In673202687, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In673202687} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In673202687, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out673202687|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In673202687} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:56:54,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In581920873 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In581920873 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In581920873 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In581920873 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out581920873| ~z$w_buff1_used~0_In581920873)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out581920873| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In581920873, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In581920873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In581920873, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In581920873} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In581920873, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In581920873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In581920873, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In581920873, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out581920873|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:56:54,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1413387751 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1413387751 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1413387751| ~z$r_buff0_thd3~0_In-1413387751) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1413387751| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1413387751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1413387751} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1413387751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1413387751, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1413387751|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:56:54,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In479408002 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In479408002 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In479408002 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In479408002 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out479408002| ~z$r_buff1_thd3~0_In479408002) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out479408002|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In479408002, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In479408002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In479408002, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In479408002} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out479408002|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In479408002, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In479408002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In479408002, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In479408002} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:56:54,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:56:54,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-329296191 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-329296191 256)))) (or (and (= ~z$w_buff0_used~0_In-329296191 |P0Thread1of1ForFork1_#t~ite5_Out-329296191|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-329296191| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-329296191, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-329296191} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-329296191|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-329296191, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-329296191} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:56:54,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1591357792 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1591357792 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1591357792 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1591357792 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1591357792 |P0Thread1of1ForFork1_#t~ite6_Out-1591357792|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1591357792|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591357792, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1591357792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1591357792, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1591357792} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591357792, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1591357792|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1591357792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1591357792, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1591357792} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:56:54,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1254301718 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1254301718 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In1254301718 ~z$r_buff0_thd1~0_Out1254301718)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out1254301718) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1254301718, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1254301718} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1254301718, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1254301718|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1254301718} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:56:54,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-2143208695 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2143208695 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2143208695 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-2143208695 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-2143208695|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-2143208695| ~z$r_buff1_thd1~0_In-2143208695) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2143208695, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2143208695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2143208695, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2143208695} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2143208695|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2143208695, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2143208695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2143208695, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2143208695} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:56:54,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:56:54,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2030693531 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In2030693531 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out2030693531|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out2030693531| ~z$w_buff0_used~0_In2030693531)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2030693531, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2030693531} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2030693531, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2030693531|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2030693531} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:56:54,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1458707467 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1458707467 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1458707467 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1458707467 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1458707467| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1458707467| ~z$w_buff1_used~0_In-1458707467) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458707467, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1458707467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1458707467, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1458707467} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458707467, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1458707467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1458707467, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1458707467|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1458707467} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:56:54,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-691097028 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-691097028 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-691097028 |P1Thread1of1ForFork2_#t~ite13_Out-691097028|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-691097028|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-691097028, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-691097028} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-691097028, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-691097028|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-691097028} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:56:54,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In265794656 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In265794656 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In265794656 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In265794656 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In265794656 |P1Thread1of1ForFork2_#t~ite14_Out265794656|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out265794656| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In265794656, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In265794656, ~z$w_buff1_used~0=~z$w_buff1_used~0_In265794656, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In265794656} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In265794656, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In265794656, ~z$w_buff1_used~0=~z$w_buff1_used~0_In265794656, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out265794656|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In265794656} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:56:54,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:56:54,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:56:54,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In540059782 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In540059782 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out540059782| ~z$w_buff1~0_In540059782) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out540059782| ~z~0_In540059782) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In540059782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In540059782, ~z$w_buff1~0=~z$w_buff1~0_In540059782, ~z~0=~z~0_In540059782} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In540059782, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out540059782|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In540059782, ~z$w_buff1~0=~z$w_buff1~0_In540059782, ~z~0=~z~0_In540059782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:56:54,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 05:56:54,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1587374235 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1587374235 256)))) (or (and (= ~z$w_buff0_used~0_In-1587374235 |ULTIMATE.start_main_#t~ite49_Out-1587374235|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1587374235|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1587374235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587374235} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1587374235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587374235, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1587374235|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:56:54,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-543389275 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-543389275 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-543389275 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-543389275 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-543389275| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-543389275 |ULTIMATE.start_main_#t~ite50_Out-543389275|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-543389275, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-543389275, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-543389275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-543389275} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-543389275|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-543389275, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-543389275, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-543389275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-543389275} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:56:54,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In642426159 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In642426159 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out642426159| 0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In642426159 |ULTIMATE.start_main_#t~ite51_Out642426159|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In642426159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In642426159} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In642426159, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out642426159|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In642426159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:56:54,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-555959328 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-555959328 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-555959328 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-555959328 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-555959328 |ULTIMATE.start_main_#t~ite52_Out-555959328|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-555959328|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-555959328, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-555959328, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-555959328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-555959328} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-555959328|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-555959328, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-555959328, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-555959328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-555959328} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:56:54,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_7 2) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= 2 v_~y~0_8) (= v_~main$tmp_guard1~0_6 0) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:56:54,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:56:54 BasicIcfg [2019-12-27 05:56:54,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:56:54,553 INFO L168 Benchmark]: Toolchain (without parser) took 121554.48 ms. Allocated memory was 143.1 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 05:56:54,553 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 05:56:54,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.76 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 153.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:54,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.29 ms. Allocated memory is still 199.8 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:54,555 INFO L168 Benchmark]: Boogie Preprocessor took 42.71 ms. Allocated memory is still 199.8 MB. Free memory was 150.3 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:54,555 INFO L168 Benchmark]: RCFGBuilder took 850.34 ms. Allocated memory is still 199.8 MB. Free memory was 148.3 MB in the beginning and 97.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:54,556 INFO L168 Benchmark]: TraceAbstraction took 119815.38 ms. Allocated memory was 199.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 97.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 05:56:54,559 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.76 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 153.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.29 ms. Allocated memory is still 199.8 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.71 ms. Allocated memory is still 199.8 MB. Free memory was 150.3 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 850.34 ms. Allocated memory is still 199.8 MB. Free memory was 148.3 MB in the beginning and 97.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119815.38 ms. Allocated memory was 199.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 97.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6462 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t678, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t679, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t680, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.4s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 48.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8643 SDtfs, 11806 SDslu, 34000 SDs, 0 SdLazy, 23791 SolverSat, 508 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 39 SyntacticMatches, 45 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3478 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 360468 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1466 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1367 ConstructedInterpolants, 0 QuantifiedInterpolants, 377091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...