/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:19:06,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:19:06,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:19:06,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:19:06,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:19:06,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:19:06,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:19:06,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:19:06,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:19:06,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:19:06,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:19:06,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:19:06,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:19:06,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:19:06,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:19:06,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:19:06,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:19:06,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:19:06,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:19:06,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:19:06,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:19:06,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:19:06,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:19:06,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:19:06,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:19:06,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:19:06,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:19:06,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:19:06,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:19:06,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:19:06,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:19:06,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:19:06,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:19:06,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:19:06,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:19:06,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:19:06,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:19:06,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:19:06,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:19:06,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:19:06,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:19:06,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:19:06,730 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:19:06,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:19:06,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:19:06,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:19:06,732 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:19:06,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:19:06,733 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:19:06,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:19:06,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:19:06,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:19:06,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:19:06,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:19:06,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:19:06,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:19:06,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:19:06,734 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:19:06,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:19:06,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:19:06,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:19:06,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:19:06,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:19:06,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:19:06,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:19:06,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:19:06,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:19:06,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:19:06,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:19:06,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:19:06,739 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:19:06,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:19:07,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:19:07,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:19:07,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:19:07,047 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:19:07,047 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:19:07,048 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-26 22:19:07,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379a0409f/06c2a2880ace4e39a661b25bb95c9d7a/FLAG89346c2a5 [2019-12-26 22:19:07,678 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:19:07,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-26 22:19:07,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379a0409f/06c2a2880ace4e39a661b25bb95c9d7a/FLAG89346c2a5 [2019-12-26 22:19:07,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379a0409f/06c2a2880ace4e39a661b25bb95c9d7a [2019-12-26 22:19:07,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:19:07,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:19:07,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:07,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:19:07,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:19:07,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:07" (1/1) ... [2019-12-26 22:19:07,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235b5037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:07, skipping insertion in model container [2019-12-26 22:19:07,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:07" (1/1) ... [2019-12-26 22:19:07,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:19:08,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:19:08,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:08,507 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:19:08,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:08,690 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:19:08,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08 WrapperNode [2019-12-26 22:19:08,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:08,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:08,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:19:08,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:19:08,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (1/1) ... [2019-12-26 22:19:08,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (1/1) ... [2019-12-26 22:19:08,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:08,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:19:08,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:19:08,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:19:08,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (1/1) ... [2019-12-26 22:19:08,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (1/1) ... [2019-12-26 22:19:08,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (1/1) ... [2019-12-26 22:19:08,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (1/1) ... [2019-12-26 22:19:08,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (1/1) ... [2019-12-26 22:19:08,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (1/1) ... [2019-12-26 22:19:08,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (1/1) ... [2019-12-26 22:19:08,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:19:08,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:19:08,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:19:08,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:19:08,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (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-26 22:19:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:19:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:19:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:19:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:19:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:19:08,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:19:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:19:08,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:19:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:19:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:19:08,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:19:08,872 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:19:09,723 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:19:09,724 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:19:09,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:19:09 BoogieIcfgContainer [2019-12-26 22:19:09,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:19:09,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:19:09,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:19:09,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:19:09,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:19:07" (1/3) ... [2019-12-26 22:19:09,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5213cda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:19:09, skipping insertion in model container [2019-12-26 22:19:09,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:08" (2/3) ... [2019-12-26 22:19:09,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5213cda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:19:09, skipping insertion in model container [2019-12-26 22:19:09,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:19:09" (3/3) ... [2019-12-26 22:19:09,734 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.oepc.i [2019-12-26 22:19:09,745 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:19:09,745 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:19:09,756 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:19:09,757 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:19:09,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,796 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,796 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,797 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,797 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,866 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,866 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,874 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:09,893 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 22:19:09,916 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:19:09,917 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:19:09,917 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:19:09,917 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:19:09,917 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:19:09,917 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:19:09,917 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:19:09,917 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:19:09,935 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-26 22:19:09,937 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-26 22:19:10,046 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-26 22:19:10,047 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:19:10,061 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:19:10,084 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-26 22:19:10,134 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-26 22:19:10,134 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:19:10,141 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:19:10,157 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 22:19:10,158 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:19:15,699 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:19:15,824 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:19:15,845 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-26 22:19:15,845 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-26 22:19:15,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-26 22:19:16,291 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-26 22:19:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-26 22:19:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:19:16,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:16,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:19:16,305 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-26 22:19:16,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:16,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339444819] [2019-12-26 22:19:16,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:16,553 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-26 22:19:16,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339444819] [2019-12-26 22:19:16,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:16,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:19:16,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829235453] [2019-12-26 22:19:16,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:16,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:16,583 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-26 22:19:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:16,871 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-26 22:19:16,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:16,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:19:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:16,988 INFO L225 Difference]: With dead ends: 8472 [2019-12-26 22:19:16,988 INFO L226 Difference]: Without dead ends: 7980 [2019-12-26 22:19:16,992 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-26 22:19:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-26 22:19:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-26 22:19:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-26 22:19:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-26 22:19:17,438 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-26 22:19:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:17,439 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-26 22:19:17,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-26 22:19:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:19:17,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:17,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:17,443 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:17,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:17,444 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-26 22:19:17,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:17,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398721775] [2019-12-26 22:19:17,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:17,519 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-26 22:19:17,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398721775] [2019-12-26 22:19:17,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:17,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:17,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299339312] [2019-12-26 22:19:17,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:17,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:17,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:17,523 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 3 states. [2019-12-26 22:19:17,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:17,555 INFO L93 Difference]: Finished difference Result 1284 states and 2972 transitions. [2019-12-26 22:19:17,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:17,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 22:19:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:17,563 INFO L225 Difference]: With dead ends: 1284 [2019-12-26 22:19:17,563 INFO L226 Difference]: Without dead ends: 1284 [2019-12-26 22:19:17,566 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-26 22:19:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-12-26 22:19:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-12-26 22:19:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-26 22:19:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2972 transitions. [2019-12-26 22:19:17,602 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2972 transitions. Word has length 11 [2019-12-26 22:19:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:17,602 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2972 transitions. [2019-12-26 22:19:17,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2972 transitions. [2019-12-26 22:19:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:19:17,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:17,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:17,610 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:17,611 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-26 22:19:17,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:17,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742035467] [2019-12-26 22:19:17,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:17,709 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-26 22:19:17,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742035467] [2019-12-26 22:19:17,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:17,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:17,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922256896] [2019-12-26 22:19:17,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:17,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:17,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:17,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:17,711 INFO L87 Difference]: Start difference. First operand 1284 states and 2972 transitions. Second operand 3 states. [2019-12-26 22:19:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:17,795 INFO L93 Difference]: Finished difference Result 1993 states and 4593 transitions. [2019-12-26 22:19:17,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:17,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 22:19:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:17,807 INFO L225 Difference]: With dead ends: 1993 [2019-12-26 22:19:17,807 INFO L226 Difference]: Without dead ends: 1993 [2019-12-26 22:19:17,808 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-26 22:19:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-26 22:19:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1444. [2019-12-26 22:19:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-26 22:19:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3429 transitions. [2019-12-26 22:19:17,852 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3429 transitions. Word has length 14 [2019-12-26 22:19:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:17,852 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3429 transitions. [2019-12-26 22:19:17,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3429 transitions. [2019-12-26 22:19:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:19:17,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:17,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:17,854 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:17,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-26 22:19:17,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:17,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875990153] [2019-12-26 22:19:17,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:17,963 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-26 22:19:17,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875990153] [2019-12-26 22:19:17,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:17,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:17,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275751926] [2019-12-26 22:19:17,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:17,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:17,968 INFO L87 Difference]: Start difference. First operand 1444 states and 3429 transitions. Second operand 4 states. [2019-12-26 22:19:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:18,186 INFO L93 Difference]: Finished difference Result 1803 states and 4159 transitions. [2019-12-26 22:19:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:19:18,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:19:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:18,196 INFO L225 Difference]: With dead ends: 1803 [2019-12-26 22:19:18,196 INFO L226 Difference]: Without dead ends: 1803 [2019-12-26 22:19:18,197 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-26 22:19:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-26 22:19:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1739. [2019-12-26 22:19:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-26 22:19:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4035 transitions. [2019-12-26 22:19:18,242 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4035 transitions. Word has length 14 [2019-12-26 22:19:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:18,243 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 4035 transitions. [2019-12-26 22:19:18,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4035 transitions. [2019-12-26 22:19:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:19:18,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:18,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:18,245 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-26 22:19:18,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:18,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276067328] [2019-12-26 22:19:18,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:18,296 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-26 22:19:18,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276067328] [2019-12-26 22:19:18,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:18,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:18,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088686021] [2019-12-26 22:19:18,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:18,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:18,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:18,299 INFO L87 Difference]: Start difference. First operand 1739 states and 4035 transitions. Second operand 4 states. [2019-12-26 22:19:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:18,496 INFO L93 Difference]: Finished difference Result 2116 states and 4835 transitions. [2019-12-26 22:19:18,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:19:18,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:19:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:18,508 INFO L225 Difference]: With dead ends: 2116 [2019-12-26 22:19:18,509 INFO L226 Difference]: Without dead ends: 2116 [2019-12-26 22:19:18,509 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-26 22:19:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-26 22:19:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1856. [2019-12-26 22:19:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-26 22:19:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4299 transitions. [2019-12-26 22:19:18,562 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4299 transitions. Word has length 14 [2019-12-26 22:19:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:18,564 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 4299 transitions. [2019-12-26 22:19:18,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4299 transitions. [2019-12-26 22:19:18,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:19:18,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:18,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] [2019-12-26 22:19:18,569 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-26 22:19:18,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:18,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610263207] [2019-12-26 22:19:18,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:18,715 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-26 22:19:18,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610263207] [2019-12-26 22:19:18,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:18,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:18,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946623358] [2019-12-26 22:19:18,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:18,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:18,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:18,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:18,718 INFO L87 Difference]: Start difference. First operand 1856 states and 4299 transitions. Second operand 5 states. [2019-12-26 22:19:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:18,985 INFO L93 Difference]: Finished difference Result 2383 states and 5349 transitions. [2019-12-26 22:19:18,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:19:18,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 22:19:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:19,006 INFO L225 Difference]: With dead ends: 2383 [2019-12-26 22:19:19,007 INFO L226 Difference]: Without dead ends: 2383 [2019-12-26 22:19:19,007 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-26 22:19:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-26 22:19:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2127. [2019-12-26 22:19:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-26 22:19:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4855 transitions. [2019-12-26 22:19:19,073 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4855 transitions. Word has length 25 [2019-12-26 22:19:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:19,073 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4855 transitions. [2019-12-26 22:19:19,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4855 transitions. [2019-12-26 22:19:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:19:19,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:19,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:19,077 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:19,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:19,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1878239565, now seen corresponding path program 1 times [2019-12-26 22:19:19,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:19,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554473942] [2019-12-26 22:19:19,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:19,132 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-26 22:19:19,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554473942] [2019-12-26 22:19:19,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:19,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:19:19,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438062667] [2019-12-26 22:19:19,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:19,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:19,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:19,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:19,135 INFO L87 Difference]: Start difference. First operand 2127 states and 4855 transitions. Second operand 3 states. [2019-12-26 22:19:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:19,149 INFO L93 Difference]: Finished difference Result 2126 states and 4853 transitions. [2019-12-26 22:19:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:19,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 22:19:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:19,162 INFO L225 Difference]: With dead ends: 2126 [2019-12-26 22:19:19,162 INFO L226 Difference]: Without dead ends: 2126 [2019-12-26 22:19:19,163 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-26 22:19:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-26 22:19:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2126. [2019-12-26 22:19:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-26 22:19:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 4853 transitions. [2019-12-26 22:19:19,213 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 4853 transitions. Word has length 26 [2019-12-26 22:19:19,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:19,213 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 4853 transitions. [2019-12-26 22:19:19,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 4853 transitions. [2019-12-26 22:19:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:19:19,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:19,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:19,217 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-26 22:19:19,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:19,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367513878] [2019-12-26 22:19:19,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:19,322 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-26 22:19:19,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367513878] [2019-12-26 22:19:19,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:19,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:19,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312626945] [2019-12-26 22:19:19,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:19,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:19,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:19,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:19,325 INFO L87 Difference]: Start difference. First operand 2126 states and 4853 transitions. Second operand 5 states. [2019-12-26 22:19:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:19,576 INFO L93 Difference]: Finished difference Result 2503 states and 5587 transitions. [2019-12-26 22:19:19,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:19:19,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:19:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:19,585 INFO L225 Difference]: With dead ends: 2503 [2019-12-26 22:19:19,586 INFO L226 Difference]: Without dead ends: 2503 [2019-12-26 22:19:19,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:19,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-26 22:19:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1976. [2019-12-26 22:19:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-12-26 22:19:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4537 transitions. [2019-12-26 22:19:19,680 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4537 transitions. Word has length 26 [2019-12-26 22:19:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:19,681 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 4537 transitions. [2019-12-26 22:19:19,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4537 transitions. [2019-12-26 22:19:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:19:19,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:19,684 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-26 22:19:19,684 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1895680429, now seen corresponding path program 1 times [2019-12-26 22:19:19,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:19,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311120966] [2019-12-26 22:19:19,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:19,727 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-26 22:19:19,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311120966] [2019-12-26 22:19:19,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:19,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:19,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219562869] [2019-12-26 22:19:19,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:19,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:19,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:19,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:19,729 INFO L87 Difference]: Start difference. First operand 1976 states and 4537 transitions. Second operand 4 states. [2019-12-26 22:19:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:19,760 INFO L93 Difference]: Finished difference Result 3149 states and 7351 transitions. [2019-12-26 22:19:19,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:19:19,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-26 22:19:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:19,765 INFO L225 Difference]: With dead ends: 3149 [2019-12-26 22:19:19,765 INFO L226 Difference]: Without dead ends: 1449 [2019-12-26 22:19:19,765 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-26 22:19:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-12-26 22:19:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1433. [2019-12-26 22:19:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-26 22:19:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3305 transitions. [2019-12-26 22:19:19,800 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3305 transitions. Word has length 27 [2019-12-26 22:19:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:19,801 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3305 transitions. [2019-12-26 22:19:19,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3305 transitions. [2019-12-26 22:19:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:19:19,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:19,803 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-26 22:19:19,803 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:19,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1902769443, now seen corresponding path program 2 times [2019-12-26 22:19:19,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:19,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259000227] [2019-12-26 22:19:19,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:19,875 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-26 22:19:19,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259000227] [2019-12-26 22:19:19,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:19,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:19:19,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035387364] [2019-12-26 22:19:19,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:19,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:19,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:19,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:19,877 INFO L87 Difference]: Start difference. First operand 1433 states and 3305 transitions. Second operand 5 states. [2019-12-26 22:19:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:20,345 INFO L93 Difference]: Finished difference Result 2262 states and 5074 transitions. [2019-12-26 22:19:20,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:19:20,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 22:19:20,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:20,352 INFO L225 Difference]: With dead ends: 2262 [2019-12-26 22:19:20,352 INFO L226 Difference]: Without dead ends: 2262 [2019-12-26 22:19:20,352 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-26 22:19:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2019-12-26 22:19:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2061. [2019-12-26 22:19:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-12-26 22:19:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4683 transitions. [2019-12-26 22:19:20,398 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4683 transitions. Word has length 27 [2019-12-26 22:19:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:20,400 INFO L462 AbstractCegarLoop]: Abstraction has 2061 states and 4683 transitions. [2019-12-26 22:19:20,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4683 transitions. [2019-12-26 22:19:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:19:20,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:20,403 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-26 22:19:20,404 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash -348234267, now seen corresponding path program 1 times [2019-12-26 22:19:20,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:20,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976488115] [2019-12-26 22:19:20,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:20,450 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-26 22:19:20,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976488115] [2019-12-26 22:19:20,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:20,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:20,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876955892] [2019-12-26 22:19:20,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:20,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:20,452 INFO L87 Difference]: Start difference. First operand 2061 states and 4683 transitions. Second operand 4 states. [2019-12-26 22:19:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:20,472 INFO L93 Difference]: Finished difference Result 1113 states and 2397 transitions. [2019-12-26 22:19:20,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:19:20,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-26 22:19:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:20,475 INFO L225 Difference]: With dead ends: 1113 [2019-12-26 22:19:20,476 INFO L226 Difference]: Without dead ends: 1002 [2019-12-26 22:19:20,476 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-26 22:19:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-26 22:19:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 960. [2019-12-26 22:19:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-26 22:19:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2144 transitions. [2019-12-26 22:19:20,495 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2144 transitions. Word has length 28 [2019-12-26 22:19:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:20,496 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2144 transitions. [2019-12-26 22:19:20,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2144 transitions. [2019-12-26 22:19:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:19:20,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:20,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:20,499 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash -359202268, now seen corresponding path program 1 times [2019-12-26 22:19:20,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:20,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811995444] [2019-12-26 22:19:20,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:20,625 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-26 22:19:20,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811995444] [2019-12-26 22:19:20,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:20,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:19:20,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377726498] [2019-12-26 22:19:20,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:19:20,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:20,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:19:20,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:20,629 INFO L87 Difference]: Start difference. First operand 960 states and 2144 transitions. Second operand 7 states. [2019-12-26 22:19:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:20,933 INFO L93 Difference]: Finished difference Result 2777 states and 5836 transitions. [2019-12-26 22:19:20,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:19:20,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 22:19:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:20,942 INFO L225 Difference]: With dead ends: 2777 [2019-12-26 22:19:20,942 INFO L226 Difference]: Without dead ends: 1853 [2019-12-26 22:19:20,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:19:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-12-26 22:19:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 998. [2019-12-26 22:19:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-12-26 22:19:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2203 transitions. [2019-12-26 22:19:20,972 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2203 transitions. Word has length 51 [2019-12-26 22:19:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:20,973 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 2203 transitions. [2019-12-26 22:19:20,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:19:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2203 transitions. [2019-12-26 22:19:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:19:20,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:20,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:20,976 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:20,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1598138544, now seen corresponding path program 2 times [2019-12-26 22:19:20,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:20,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020688512] [2019-12-26 22:19:20,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:21,091 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-26 22:19:21,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020688512] [2019-12-26 22:19:21,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:21,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:19:21,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570574374] [2019-12-26 22:19:21,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:21,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:21,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:21,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:21,093 INFO L87 Difference]: Start difference. First operand 998 states and 2203 transitions. Second operand 5 states. [2019-12-26 22:19:21,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:21,354 INFO L93 Difference]: Finished difference Result 1135 states and 2453 transitions. [2019-12-26 22:19:21,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:19:21,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-26 22:19:21,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:21,358 INFO L225 Difference]: With dead ends: 1135 [2019-12-26 22:19:21,358 INFO L226 Difference]: Without dead ends: 1135 [2019-12-26 22:19:21,359 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-26 22:19:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2019-12-26 22:19:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1047. [2019-12-26 22:19:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-12-26 22:19:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 2300 transitions. [2019-12-26 22:19:21,380 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 2300 transitions. Word has length 51 [2019-12-26 22:19:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:21,380 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 2300 transitions. [2019-12-26 22:19:21,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 2300 transitions. [2019-12-26 22:19:21,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:19:21,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:21,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:21,384 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:21,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1838514274, now seen corresponding path program 3 times [2019-12-26 22:19:21,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:21,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945591568] [2019-12-26 22:19:21,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:21,478 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-26 22:19:21,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945591568] [2019-12-26 22:19:21,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:21,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:21,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416378451] [2019-12-26 22:19:21,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:21,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:21,480 INFO L87 Difference]: Start difference. First operand 1047 states and 2300 transitions. Second operand 3 states. [2019-12-26 22:19:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:21,495 INFO L93 Difference]: Finished difference Result 1046 states and 2298 transitions. [2019-12-26 22:19:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:21,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 22:19:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:21,498 INFO L225 Difference]: With dead ends: 1046 [2019-12-26 22:19:21,499 INFO L226 Difference]: Without dead ends: 1046 [2019-12-26 22:19:21,499 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-26 22:19:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-12-26 22:19:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 931. [2019-12-26 22:19:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-26 22:19:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 2087 transitions. [2019-12-26 22:19:21,518 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 2087 transitions. Word has length 51 [2019-12-26 22:19:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:21,518 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 2087 transitions. [2019-12-26 22:19:21,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 2087 transitions. [2019-12-26 22:19:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:19:21,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:21,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:21,521 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash 505389010, now seen corresponding path program 1 times [2019-12-26 22:19:21,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:21,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095922128] [2019-12-26 22:19:21,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:21,687 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-26 22:19:21,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095922128] [2019-12-26 22:19:21,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:21,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:19:21,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811539682] [2019-12-26 22:19:21,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:19:21,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:21,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:19:21,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:19:21,689 INFO L87 Difference]: Start difference. First operand 931 states and 2087 transitions. Second operand 8 states. [2019-12-26 22:19:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:22,306 INFO L93 Difference]: Finished difference Result 1244 states and 2634 transitions. [2019-12-26 22:19:22,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:19:22,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-26 22:19:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:22,311 INFO L225 Difference]: With dead ends: 1244 [2019-12-26 22:19:22,311 INFO L226 Difference]: Without dead ends: 1244 [2019-12-26 22:19:22,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:19:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-12-26 22:19:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 736. [2019-12-26 22:19:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-26 22:19:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1583 transitions. [2019-12-26 22:19:22,329 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1583 transitions. Word has length 52 [2019-12-26 22:19:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:22,329 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1583 transitions. [2019-12-26 22:19:22,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:19:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1583 transitions. [2019-12-26 22:19:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:19:22,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:22,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:22,332 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:22,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:22,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1643675972, now seen corresponding path program 2 times [2019-12-26 22:19:22,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:22,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154524174] [2019-12-26 22:19:22,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:22,422 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-26 22:19:22,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154524174] [2019-12-26 22:19:22,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:22,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:22,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887277368] [2019-12-26 22:19:22,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:22,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:22,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:22,424 INFO L87 Difference]: Start difference. First operand 736 states and 1583 transitions. Second operand 4 states. [2019-12-26 22:19:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:22,489 INFO L93 Difference]: Finished difference Result 900 states and 1911 transitions. [2019-12-26 22:19:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:22,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-26 22:19:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:22,492 INFO L225 Difference]: With dead ends: 900 [2019-12-26 22:19:22,492 INFO L226 Difference]: Without dead ends: 900 [2019-12-26 22:19:22,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-26 22:19:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 750. [2019-12-26 22:19:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-12-26 22:19:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1614 transitions. [2019-12-26 22:19:22,508 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1614 transitions. Word has length 52 [2019-12-26 22:19:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:22,509 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1614 transitions. [2019-12-26 22:19:22,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1614 transitions. [2019-12-26 22:19:22,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:22,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:22,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:22,511 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:22,512 INFO L82 PathProgramCache]: Analyzing trace with hash -122108504, now seen corresponding path program 1 times [2019-12-26 22:19:22,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:22,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754963317] [2019-12-26 22:19:22,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:22,565 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-26 22:19:22,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754963317] [2019-12-26 22:19:22,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:22,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:19:22,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963399583] [2019-12-26 22:19:22,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:22,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:22,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:22,567 INFO L87 Difference]: Start difference. First operand 750 states and 1614 transitions. Second operand 4 states. [2019-12-26 22:19:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:22,762 INFO L93 Difference]: Finished difference Result 1223 states and 2628 transitions. [2019-12-26 22:19:22,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:19:22,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-26 22:19:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:22,766 INFO L225 Difference]: With dead ends: 1223 [2019-12-26 22:19:22,766 INFO L226 Difference]: Without dead ends: 1223 [2019-12-26 22:19:22,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-26 22:19:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-12-26 22:19:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 825. [2019-12-26 22:19:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-12-26 22:19:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1799 transitions. [2019-12-26 22:19:22,786 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1799 transitions. Word has length 53 [2019-12-26 22:19:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:22,786 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1799 transitions. [2019-12-26 22:19:22,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1799 transitions. [2019-12-26 22:19:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:22,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:22,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:22,789 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1190562228, now seen corresponding path program 1 times [2019-12-26 22:19:22,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:22,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640396884] [2019-12-26 22:19:22,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:22,843 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-26 22:19:22,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640396884] [2019-12-26 22:19:22,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:22,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:19:22,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675748618] [2019-12-26 22:19:22,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:22,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:22,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:22,845 INFO L87 Difference]: Start difference. First operand 825 states and 1799 transitions. Second operand 5 states. [2019-12-26 22:19:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:23,060 INFO L93 Difference]: Finished difference Result 992 states and 2117 transitions. [2019-12-26 22:19:23,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:19:23,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-26 22:19:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:23,062 INFO L225 Difference]: With dead ends: 992 [2019-12-26 22:19:23,063 INFO L226 Difference]: Without dead ends: 992 [2019-12-26 22:19:23,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:19:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-12-26 22:19:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 878. [2019-12-26 22:19:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-26 22:19:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1896 transitions. [2019-12-26 22:19:23,083 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1896 transitions. Word has length 53 [2019-12-26 22:19:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:23,083 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1896 transitions. [2019-12-26 22:19:23,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1896 transitions. [2019-12-26 22:19:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:23,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:23,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:23,087 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash 821991690, now seen corresponding path program 1 times [2019-12-26 22:19:23,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:23,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044118147] [2019-12-26 22:19:23,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:23,224 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-26 22:19:23,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044118147] [2019-12-26 22:19:23,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:23,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:19:23,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339764082] [2019-12-26 22:19:23,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:19:23,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:23,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:19:23,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:23,227 INFO L87 Difference]: Start difference. First operand 878 states and 1896 transitions. Second operand 7 states. [2019-12-26 22:19:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:23,520 INFO L93 Difference]: Finished difference Result 2191 states and 4561 transitions. [2019-12-26 22:19:23,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:19:23,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-26 22:19:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:23,523 INFO L225 Difference]: With dead ends: 2191 [2019-12-26 22:19:23,523 INFO L226 Difference]: Without dead ends: 1789 [2019-12-26 22:19:23,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:19:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-12-26 22:19:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 873. [2019-12-26 22:19:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-12-26 22:19:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1883 transitions. [2019-12-26 22:19:23,549 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1883 transitions. Word has length 53 [2019-12-26 22:19:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:23,550 INFO L462 AbstractCegarLoop]: Abstraction has 873 states and 1883 transitions. [2019-12-26 22:19:23,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:19:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1883 transitions. [2019-12-26 22:19:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:23,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:23,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:23,553 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash 813658986, now seen corresponding path program 2 times [2019-12-26 22:19:23,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:23,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378851811] [2019-12-26 22:19:23,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:23,720 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-26 22:19:23,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378851811] [2019-12-26 22:19:23,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:23,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:19:23,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880786947] [2019-12-26 22:19:23,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:19:23,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:23,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:19:23,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:19:23,722 INFO L87 Difference]: Start difference. First operand 873 states and 1883 transitions. Second operand 6 states. [2019-12-26 22:19:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:23,798 INFO L93 Difference]: Finished difference Result 860 states and 1840 transitions. [2019-12-26 22:19:23,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:19:23,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-26 22:19:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:23,799 INFO L225 Difference]: With dead ends: 860 [2019-12-26 22:19:23,800 INFO L226 Difference]: Without dead ends: 860 [2019-12-26 22:19:23,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-12-26 22:19:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 721. [2019-12-26 22:19:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-12-26 22:19:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1538 transitions. [2019-12-26 22:19:23,812 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1538 transitions. Word has length 53 [2019-12-26 22:19:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:23,812 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 1538 transitions. [2019-12-26 22:19:23,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:19:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1538 transitions. [2019-12-26 22:19:23,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:23,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:23,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:23,815 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:23,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-26 22:19:23,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:23,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446935433] [2019-12-26 22:19:23,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:19:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:19:23,966 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:19:23,967 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:19:23,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_316) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t841~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$read_delayed~0_7) (= v_~y~0_90 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t841~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t841~0.base_35|) |v_ULTIMATE.start_main_~#t841~0.offset_23| 0)) |v_#memory_int_13|) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t841~0.base_35|) 0) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t841~0.base_35| 4) |v_#length_15|) (= 0 v_~a$r_buff0_thd1~0_236) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t841~0.base_35|) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= |v_ULTIMATE.start_main_~#t841~0.offset_23| 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t842~0.offset=|v_ULTIMATE.start_main_~#t842~0.offset_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, ULTIMATE.start_main_~#t841~0.base=|v_ULTIMATE.start_main_~#t841~0.base_35|, #length=|v_#length_15|, ULTIMATE.start_main_~#t841~0.offset=|v_ULTIMATE.start_main_~#t841~0.offset_23|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t842~0.base=|v_ULTIMATE.start_main_~#t842~0.base_27|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t842~0.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t841~0.base, #length, ULTIMATE.start_main_~#t841~0.offset, ~y~0, ULTIMATE.start_main_~#t842~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 22:19:23,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0_#in~arg.base_In-1474888002| P0Thread1of1ForFork0_~arg.base_Out-1474888002) (= ~a$w_buff1_used~0_Out-1474888002 ~a$w_buff0_used~0_In-1474888002) (= ~a$w_buff1~0_Out-1474888002 ~a$w_buff0~0_In-1474888002) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1474888002 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1474888002|) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1474888002|) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1474888002| P0Thread1of1ForFork0_~arg.offset_Out-1474888002) (= 0 (mod ~a$w_buff1_used~0_Out-1474888002 256)) (= ~a$w_buff0~0_Out-1474888002 1) (= 1 ~a$w_buff0_used~0_Out-1474888002)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1474888002|, ~a$w_buff0~0=~a$w_buff0~0_In-1474888002, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1474888002|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1474888002} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1474888002|, ~a$w_buff1~0=~a$w_buff1~0_Out-1474888002, ~a$w_buff0~0=~a$w_buff0~0_Out-1474888002, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1474888002, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1474888002|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1474888002, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1474888002, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1474888002, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1474888002|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1474888002} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:19:23,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t842~0.base_10| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t842~0.base_10|) 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t842~0.base_10| 1) |v_#valid_19|) (= |v_ULTIMATE.start_main_~#t842~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t842~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t842~0.base_10|) |v_ULTIMATE.start_main_~#t842~0.offset_9| 1))) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t842~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t842~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t842~0.base=|v_ULTIMATE.start_main_~#t842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t842~0.offset=|v_ULTIMATE.start_main_~#t842~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t842~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t842~0.offset, #length] because there is no mapped edge [2019-12-26 22:19:23,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1430886441 256) 0))) (or (and (= ~a$w_buff1_used~0_In1430886441 |P1Thread1of1ForFork1_#t~ite23_Out1430886441|) (= |P1Thread1of1ForFork1_#t~ite24_Out1430886441| |P1Thread1of1ForFork1_#t~ite23_Out1430886441|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1430886441 256)))) (or (and (= (mod ~a$r_buff1_thd2~0_In1430886441 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In1430886441 256)) (and (= (mod ~a$w_buff1_used~0_In1430886441 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite23_In1430886441| |P1Thread1of1ForFork1_#t~ite23_Out1430886441|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out1430886441| ~a$w_buff1_used~0_In1430886441)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1430886441, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1430886441, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1430886441|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1430886441, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1430886441, ~weak$$choice2~0=~weak$$choice2~0_In1430886441} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1430886441, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1430886441|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1430886441, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1430886441|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1430886441, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1430886441, ~weak$$choice2~0=~weak$$choice2~0_In1430886441} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-26 22:19:23,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_12|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 22:19:23,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-1434750640 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1434750640 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1434750640 |P0Thread1of1ForFork0_#t~ite5_Out-1434750640|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1434750640|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1434750640, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1434750640} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1434750640|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1434750640, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1434750640} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:19:23,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd1~0_In297050518 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In297050518 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In297050518 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In297050518 256)))) (or (and (= ~a$w_buff1_used~0_In297050518 |P0Thread1of1ForFork0_#t~ite6_Out297050518|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out297050518|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In297050518, ~a$w_buff0_used~0=~a$w_buff0_used~0_In297050518, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In297050518, ~a$w_buff1_used~0=~a$w_buff1_used~0_In297050518} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out297050518|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In297050518, ~a$w_buff0_used~0=~a$w_buff0_used~0_In297050518, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In297050518, ~a$w_buff1_used~0=~a$w_buff1_used~0_In297050518} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:19:23,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-475739012 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-475739012 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out-475739012 ~a$r_buff0_thd1~0_In-475739012) (or .cse0 .cse1)) (and (= ~a$r_buff0_thd1~0_Out-475739012 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-475739012, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-475739012} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-475739012|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-475739012, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-475739012} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:19:23,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-514064552 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-514064552 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-514064552 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-514064552 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In-514064552 |P0Thread1of1ForFork0_#t~ite8_Out-514064552|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-514064552|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-514064552, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-514064552, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-514064552, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-514064552} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-514064552, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-514064552|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-514064552, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-514064552, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-514064552} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:19:23,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:19:23,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_13|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 22:19:23,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-738224800| |P1Thread1of1ForFork1_#t~ite32_Out-738224800|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-738224800 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-738224800 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~a$w_buff1~0_In-738224800 |P1Thread1of1ForFork1_#t~ite32_Out-738224800|)) (and (= ~a~0_In-738224800 |P1Thread1of1ForFork1_#t~ite32_Out-738224800|) .cse1 (or .cse0 .cse2)))) InVars {~a~0=~a~0_In-738224800, ~a$w_buff1~0=~a$w_buff1~0_In-738224800, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-738224800, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-738224800} OutVars{~a~0=~a~0_In-738224800, ~a$w_buff1~0=~a$w_buff1~0_In-738224800, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-738224800, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-738224800|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-738224800|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-738224800} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 22:19:23,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1965774307 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1965774307 256)))) (or (and (= ~a$w_buff0_used~0_In-1965774307 |P1Thread1of1ForFork1_#t~ite34_Out-1965774307|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1965774307|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1965774307, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1965774307} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1965774307|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1965774307, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1965774307} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 22:19:23,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1368239834 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1368239834 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1368239834 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1368239834 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1368239834|)) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-1368239834 |P1Thread1of1ForFork1_#t~ite35_Out-1368239834|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1368239834, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1368239834, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1368239834, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1368239834} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1368239834, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1368239834, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1368239834, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1368239834|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1368239834} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 22:19:23,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1175674338 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1175674338 256)))) (or (and (= ~a$r_buff0_thd2~0_In1175674338 |P1Thread1of1ForFork1_#t~ite36_Out1175674338|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1175674338|) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1175674338, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1175674338} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1175674338, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1175674338, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1175674338|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 22:19:23,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1906930671 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1906930671 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1906930671 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1906930671 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1906930671| ~a$r_buff1_thd2~0_In-1906930671) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1906930671| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1906930671, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1906930671, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1906930671, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1906930671} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1906930671, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1906930671, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1906930671, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1906930671, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1906930671|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:19:23,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~a$r_buff1_thd2~0_110) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:19:23,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 22:19:23,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1991667119 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1991667119 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1991667119| ~a~0_In1991667119)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1991667119| ~a$w_buff1~0_In1991667119)))) InVars {~a~0=~a~0_In1991667119, ~a$w_buff1~0=~a$w_buff1~0_In1991667119, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1991667119, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1991667119} OutVars{~a~0=~a~0_In1991667119, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1991667119|, ~a$w_buff1~0=~a$w_buff1~0_In1991667119, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1991667119, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1991667119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:19:23,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:19:23,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-2050831649 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-2050831649 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-2050831649| ~a$w_buff0_used~0_In-2050831649) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-2050831649| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2050831649, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2050831649} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2050831649, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2050831649, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2050831649|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:19:24,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1769765468 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1769765468 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1769765468 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1769765468 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1769765468 |ULTIMATE.start_main_#t~ite43_Out1769765468|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1769765468|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1769765468, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1769765468, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1769765468, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1769765468} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1769765468, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1769765468, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1769765468, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1769765468, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1769765468|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 22:19:24,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1312074362 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1312074362 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1312074362| ~a$r_buff0_thd0~0_In-1312074362)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1312074362| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1312074362, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1312074362} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1312074362, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1312074362, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1312074362|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:19:24,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1095369998 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1095369998 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1095369998 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1095369998 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1095369998| ~a$r_buff1_thd0~0_In-1095369998)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out-1095369998| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1095369998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1095369998, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1095369998, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1095369998} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1095369998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1095369998, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1095369998, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1095369998, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1095369998|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:19:24,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:19:24,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:19:24 BasicIcfg [2019-12-26 22:19:24,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:19:24,120 INFO L168 Benchmark]: Toolchain (without parser) took 16168.38 ms. Allocated memory was 138.4 MB in the beginning and 454.6 MB in the end (delta: 316.1 MB). Free memory was 101.6 MB in the beginning and 242.1 MB in the end (delta: -140.5 MB). Peak memory consumption was 175.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:24,121 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:19:24,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.66 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 155.1 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:24,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.01 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:24,124 INFO L168 Benchmark]: Boogie Preprocessor took 38.83 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:24,125 INFO L168 Benchmark]: RCFGBuilder took 935.58 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 105.1 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:24,125 INFO L168 Benchmark]: TraceAbstraction took 14390.55 ms. Allocated memory was 202.9 MB in the beginning and 454.6 MB in the end (delta: 251.7 MB). Free memory was 104.4 MB in the beginning and 242.1 MB in the end (delta: -137.6 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:24,131 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 738.66 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 155.1 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.01 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.83 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 935.58 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 105.1 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14390.55 ms. Allocated memory was 202.9 MB in the beginning and 454.6 MB in the end (delta: 251.7 MB). Free memory was 104.4 MB in the beginning and 242.1 MB in the end (delta: -137.6 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t841, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t842, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.0s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2407 SDtfs, 2361 SDslu, 4418 SDs, 0 SdLazy, 2447 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 5198 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 107217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...