/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:04:17,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:04:17,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:04:17,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:04:17,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:04:17,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:04:17,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:04:17,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:04:17,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:04:17,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:04:17,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:04:17,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:04:17,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:04:17,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:04:17,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:04:17,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:04:17,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:04:17,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:04:17,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:04:17,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:04:17,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:04:17,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:04:17,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:04:17,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:04:17,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:04:17,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:04:17,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:04:17,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:04:17,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:04:17,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:04:17,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:04:17,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:04:17,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:04:17,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:04:17,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:04:17,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:04:17,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:04:17,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:04:17,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:04:17,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:04:17,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:04:17,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:04:17,813 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:04:17,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:04:17,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:04:17,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:04:17,818 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:04:17,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:04:17,818 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:04:17,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:04:17,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:04:17,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:04:17,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:04:17,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:04:17,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:04:17,820 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:04:17,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:04:17,821 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:04:17,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:04:17,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:04:17,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:04:17,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:04:17,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:04:17,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:04:17,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:04:17,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:04:17,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:04:17,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:04:17,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:04:17,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:04:17,824 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:04:18,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:04:18,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:04:18,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:04:18,124 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:04:18,125 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:04:18,125 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-18 19:04:18,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7c65b16/d7959e970e124a7691397fb1996587b5/FLAG13a6e7497 [2019-12-18 19:04:18,727 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:04:18,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-18 19:04:18,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7c65b16/d7959e970e124a7691397fb1996587b5/FLAG13a6e7497 [2019-12-18 19:04:19,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7c65b16/d7959e970e124a7691397fb1996587b5 [2019-12-18 19:04:19,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:04:19,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:04:19,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:19,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:04:19,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:04:19,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192f3ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19, skipping insertion in model container [2019-12-18 19:04:19,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:04:19,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:04:19,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:19,749 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:04:19,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:19,898 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:04:19,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19 WrapperNode [2019-12-18 19:04:19,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:19,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:19,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:04:19,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:04:19,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:19,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:04:19,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:04:19,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:04:19,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:19,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... [2019-12-18 19:04:20,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:04:20,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:04:20,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:04:20,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:04:20,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:04:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:04:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:04:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:04:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:04:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:04:20,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:04:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:04:20,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:04:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:04:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:04:20,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:04:20,083 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:04:20,804 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:04:20,804 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:04:20,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:20 BoogieIcfgContainer [2019-12-18 19:04:20,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:04:20,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:04:20,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:04:20,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:04:20,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:04:19" (1/3) ... [2019-12-18 19:04:20,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d95761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:20, skipping insertion in model container [2019-12-18 19:04:20,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:19" (2/3) ... [2019-12-18 19:04:20,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d95761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:20, skipping insertion in model container [2019-12-18 19:04:20,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:20" (3/3) ... [2019-12-18 19:04:20,819 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2019-12-18 19:04:20,831 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:04:20,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:04:20,843 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:04:20,844 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:04:20,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,897 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,897 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,897 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,898 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,898 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,908 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,908 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,929 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,929 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,935 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:20,957 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:04:20,975 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:04:20,976 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:04:20,976 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:04:20,976 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:04:20,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:04:20,976 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:04:20,977 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:04:20,977 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:04:20,994 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 19:04:20,996 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 19:04:21,087 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 19:04:21,087 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:21,102 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 19:04:21,119 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 19:04:21,158 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 19:04:21,158 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:21,163 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 19:04:21,175 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 19:04:21,177 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:04:25,480 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 19:04:25,603 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 19:04:25,652 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-18 19:04:25,661 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 19:04:25,666 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 19:04:26,163 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-18 19:04:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-18 19:04:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:04:26,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:26,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:04:26,174 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-18 19:04:26,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:26,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062848759] [2019-12-18 19:04:26,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:26,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062848759] [2019-12-18 19:04:26,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:26,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:04:26,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752981379] [2019-12-18 19:04:26,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:26,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:26,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:26,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:26,430 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-18 19:04:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:26,657 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-18 19:04:26,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:26,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:04:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:26,764 INFO L225 Difference]: With dead ends: 8394 [2019-12-18 19:04:26,764 INFO L226 Difference]: Without dead ends: 8226 [2019-12-18 19:04:26,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-18 19:04:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-18 19:04:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-18 19:04:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-18 19:04:27,194 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-18 19:04:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:27,194 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-18 19:04:27,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-18 19:04:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:04:27,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:27,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:27,198 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:27,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:27,199 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-18 19:04:27,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:27,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381678997] [2019-12-18 19:04:27,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:27,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381678997] [2019-12-18 19:04:27,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:27,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:27,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565275612] [2019-12-18 19:04:27,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:27,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:27,333 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-18 19:04:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:27,824 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-18 19:04:27,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:27,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:04:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:27,900 INFO L225 Difference]: With dead ends: 12778 [2019-12-18 19:04:27,900 INFO L226 Difference]: Without dead ends: 12771 [2019-12-18 19:04:27,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-18 19:04:28,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-18 19:04:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-18 19:04:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-18 19:04:28,298 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-18 19:04:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:28,299 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-18 19:04:28,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-18 19:04:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:04:28,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:28,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:28,305 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:28,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-18 19:04:28,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:28,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312396102] [2019-12-18 19:04:28,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:28,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312396102] [2019-12-18 19:04:28,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:28,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:28,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207175722] [2019-12-18 19:04:28,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:28,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:28,415 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-18 19:04:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:29,179 INFO L93 Difference]: Finished difference Result 14268 states and 44852 transitions. [2019-12-18 19:04:29,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:29,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:04:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:29,224 INFO L225 Difference]: With dead ends: 14268 [2019-12-18 19:04:29,224 INFO L226 Difference]: Without dead ends: 14268 [2019-12-18 19:04:29,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2019-12-18 19:04:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 12752. [2019-12-18 19:04:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12752 states. [2019-12-18 19:04:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 40448 transitions. [2019-12-18 19:04:29,644 INFO L78 Accepts]: Start accepts. Automaton has 12752 states and 40448 transitions. Word has length 11 [2019-12-18 19:04:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:29,644 INFO L462 AbstractCegarLoop]: Abstraction has 12752 states and 40448 transitions. [2019-12-18 19:04:29,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 12752 states and 40448 transitions. [2019-12-18 19:04:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:04:29,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:29,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:29,650 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:29,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1372508181, now seen corresponding path program 1 times [2019-12-18 19:04:29,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:29,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535409118] [2019-12-18 19:04:29,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:29,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-18 19:04:29,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535409118] [2019-12-18 19:04:29,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:29,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:29,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828546689] [2019-12-18 19:04:29,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:29,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:29,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:29,723 INFO L87 Difference]: Start difference. First operand 12752 states and 40448 transitions. Second operand 5 states. [2019-12-18 19:04:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:30,300 INFO L93 Difference]: Finished difference Result 17010 states and 52843 transitions. [2019-12-18 19:04:30,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:04:30,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:04:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:30,341 INFO L225 Difference]: With dead ends: 17010 [2019-12-18 19:04:30,341 INFO L226 Difference]: Without dead ends: 17003 [2019-12-18 19:04:30,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:04:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17003 states. [2019-12-18 19:04:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17003 to 12755. [2019-12-18 19:04:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12755 states. [2019-12-18 19:04:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 40342 transitions. [2019-12-18 19:04:30,717 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 40342 transitions. Word has length 17 [2019-12-18 19:04:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:30,718 INFO L462 AbstractCegarLoop]: Abstraction has 12755 states and 40342 transitions. [2019-12-18 19:04:30,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 40342 transitions. [2019-12-18 19:04:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:04:30,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:30,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:30,733 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1155459573, now seen corresponding path program 1 times [2019-12-18 19:04:30,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:30,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344424374] [2019-12-18 19:04:30,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:30,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344424374] [2019-12-18 19:04:30,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:30,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:30,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479272001] [2019-12-18 19:04:30,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:30,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:30,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:30,784 INFO L87 Difference]: Start difference. First operand 12755 states and 40342 transitions. Second operand 3 states. [2019-12-18 19:04:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:30,892 INFO L93 Difference]: Finished difference Result 15529 states and 48523 transitions. [2019-12-18 19:04:30,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:30,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 19:04:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:30,922 INFO L225 Difference]: With dead ends: 15529 [2019-12-18 19:04:30,923 INFO L226 Difference]: Without dead ends: 15529 [2019-12-18 19:04:30,923 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-18 19:04:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-12-18 19:04:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 13746. [2019-12-18 19:04:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13746 states. [2019-12-18 19:04:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13746 states to 13746 states and 43375 transitions. [2019-12-18 19:04:31,417 INFO L78 Accepts]: Start accepts. Automaton has 13746 states and 43375 transitions. Word has length 25 [2019-12-18 19:04:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:31,419 INFO L462 AbstractCegarLoop]: Abstraction has 13746 states and 43375 transitions. [2019-12-18 19:04:31,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 13746 states and 43375 transitions. [2019-12-18 19:04:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:04:31,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:31,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:31,434 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1248228747, now seen corresponding path program 1 times [2019-12-18 19:04:31,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:31,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149873932] [2019-12-18 19:04:31,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:31,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149873932] [2019-12-18 19:04:31,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:31,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:04:31,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189343677] [2019-12-18 19:04:31,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:31,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:31,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:31,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:31,529 INFO L87 Difference]: Start difference. First operand 13746 states and 43375 transitions. Second operand 6 states. [2019-12-18 19:04:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:31,987 INFO L93 Difference]: Finished difference Result 19657 states and 60760 transitions. [2019-12-18 19:04:31,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:04:31,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 19:04:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:32,015 INFO L225 Difference]: With dead ends: 19657 [2019-12-18 19:04:32,016 INFO L226 Difference]: Without dead ends: 19641 [2019-12-18 19:04:32,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:04:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19641 states. [2019-12-18 19:04:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19641 to 15905. [2019-12-18 19:04:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15905 states. [2019-12-18 19:04:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15905 states to 15905 states and 49859 transitions. [2019-12-18 19:04:33,291 INFO L78 Accepts]: Start accepts. Automaton has 15905 states and 49859 transitions. Word has length 25 [2019-12-18 19:04:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:33,291 INFO L462 AbstractCegarLoop]: Abstraction has 15905 states and 49859 transitions. [2019-12-18 19:04:33,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 15905 states and 49859 transitions. [2019-12-18 19:04:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:04:33,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:33,322 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] [2019-12-18 19:04:33,322 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 279625016, now seen corresponding path program 1 times [2019-12-18 19:04:33,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:33,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991160274] [2019-12-18 19:04:33,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:33,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991160274] [2019-12-18 19:04:33,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:33,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:33,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024685772] [2019-12-18 19:04:33,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:33,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:33,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:33,470 INFO L87 Difference]: Start difference. First operand 15905 states and 49859 transitions. Second operand 4 states. [2019-12-18 19:04:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:33,503 INFO L93 Difference]: Finished difference Result 2247 states and 5122 transitions. [2019-12-18 19:04:33,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:04:33,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-18 19:04:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:33,506 INFO L225 Difference]: With dead ends: 2247 [2019-12-18 19:04:33,509 INFO L226 Difference]: Without dead ends: 1970 [2019-12-18 19:04:33,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-18 19:04:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-18 19:04:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2019-12-18 19:04:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-12-18 19:04:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4356 transitions. [2019-12-18 19:04:33,536 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 4356 transitions. Word has length 31 [2019-12-18 19:04:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:33,536 INFO L462 AbstractCegarLoop]: Abstraction has 1970 states and 4356 transitions. [2019-12-18 19:04:33,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 4356 transitions. [2019-12-18 19:04:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 19:04:33,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:33,540 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] [2019-12-18 19:04:33,540 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:33,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623832, now seen corresponding path program 1 times [2019-12-18 19:04:33,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:33,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103826987] [2019-12-18 19:04:33,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:33,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103826987] [2019-12-18 19:04:33,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:33,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:33,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969092245] [2019-12-18 19:04:33,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:04:33,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:04:33,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:04:33,643 INFO L87 Difference]: Start difference. First operand 1970 states and 4356 transitions. Second operand 7 states. [2019-12-18 19:04:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:34,265 INFO L93 Difference]: Finished difference Result 2561 states and 5544 transitions. [2019-12-18 19:04:34,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:04:34,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-18 19:04:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:34,270 INFO L225 Difference]: With dead ends: 2561 [2019-12-18 19:04:34,270 INFO L226 Difference]: Without dead ends: 2559 [2019-12-18 19:04:34,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:04:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2019-12-18 19:04:34,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2033. [2019-12-18 19:04:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-12-18 19:04:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 4500 transitions. [2019-12-18 19:04:34,306 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 4500 transitions. Word has length 37 [2019-12-18 19:04:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:34,306 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 4500 transitions. [2019-12-18 19:04:34,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:04:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 4500 transitions. [2019-12-18 19:04:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 19:04:34,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:34,312 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] [2019-12-18 19:04:34,312 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:34,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash -669150451, now seen corresponding path program 1 times [2019-12-18 19:04:34,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:34,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151104333] [2019-12-18 19:04:34,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:34,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151104333] [2019-12-18 19:04:34,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:34,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:34,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609065267] [2019-12-18 19:04:34,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:34,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:34,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:34,398 INFO L87 Difference]: Start difference. First operand 2033 states and 4500 transitions. Second operand 5 states. [2019-12-18 19:04:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:34,864 INFO L93 Difference]: Finished difference Result 2780 states and 6027 transitions. [2019-12-18 19:04:34,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:34,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 19:04:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:34,868 INFO L225 Difference]: With dead ends: 2780 [2019-12-18 19:04:34,868 INFO L226 Difference]: Without dead ends: 2780 [2019-12-18 19:04:34,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-12-18 19:04:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2441. [2019-12-18 19:04:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-18 19:04:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 5347 transitions. [2019-12-18 19:04:34,988 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 5347 transitions. Word has length 41 [2019-12-18 19:04:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:34,989 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 5347 transitions. [2019-12-18 19:04:34,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 5347 transitions. [2019-12-18 19:04:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 19:04:34,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:34,992 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] [2019-12-18 19:04:34,992 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:34,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:34,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1265386816, now seen corresponding path program 1 times [2019-12-18 19:04:34,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:34,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024033153] [2019-12-18 19:04:34,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:35,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024033153] [2019-12-18 19:04:35,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:35,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:35,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529307111] [2019-12-18 19:04:35,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:35,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:35,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:35,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:35,073 INFO L87 Difference]: Start difference. First operand 2441 states and 5347 transitions. Second operand 5 states. [2019-12-18 19:04:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:35,591 INFO L93 Difference]: Finished difference Result 3289 states and 7089 transitions. [2019-12-18 19:04:35,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:04:35,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 19:04:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:35,595 INFO L225 Difference]: With dead ends: 3289 [2019-12-18 19:04:35,595 INFO L226 Difference]: Without dead ends: 3289 [2019-12-18 19:04:35,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:04:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2019-12-18 19:04:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2732. [2019-12-18 19:04:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2019-12-18 19:04:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 5972 transitions. [2019-12-18 19:04:35,626 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 5972 transitions. Word has length 42 [2019-12-18 19:04:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:35,626 INFO L462 AbstractCegarLoop]: Abstraction has 2732 states and 5972 transitions. [2019-12-18 19:04:35,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 5972 transitions. [2019-12-18 19:04:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 19:04:35,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:35,630 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] [2019-12-18 19:04:35,630 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:35,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1349071825, now seen corresponding path program 1 times [2019-12-18 19:04:35,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:35,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971590406] [2019-12-18 19:04:35,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:35,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-18 19:04:35,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971590406] [2019-12-18 19:04:35,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:35,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:04:35,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72178968] [2019-12-18 19:04:35,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:35,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:35,711 INFO L87 Difference]: Start difference. First operand 2732 states and 5972 transitions. Second operand 5 states. [2019-12-18 19:04:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:35,748 INFO L93 Difference]: Finished difference Result 706 states and 1302 transitions. [2019-12-18 19:04:35,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:35,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 19:04:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:35,749 INFO L225 Difference]: With dead ends: 706 [2019-12-18 19:04:35,749 INFO L226 Difference]: Without dead ends: 626 [2019-12-18 19:04:35,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:04:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-12-18 19:04:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 500. [2019-12-18 19:04:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-18 19:04:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 913 transitions. [2019-12-18 19:04:35,754 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 913 transitions. Word has length 42 [2019-12-18 19:04:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:35,755 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 913 transitions. [2019-12-18 19:04:35,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 913 transitions. [2019-12-18 19:04:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 19:04:35,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:35,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:35,757 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1583281740, now seen corresponding path program 1 times [2019-12-18 19:04:35,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:35,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341846741] [2019-12-18 19:04:35,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:35,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341846741] [2019-12-18 19:04:35,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:35,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:04:35,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788848414] [2019-12-18 19:04:35,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:35,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:35,845 INFO L87 Difference]: Start difference. First operand 500 states and 913 transitions. Second operand 6 states. [2019-12-18 19:04:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:36,146 INFO L93 Difference]: Finished difference Result 701 states and 1268 transitions. [2019-12-18 19:04:36,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:04:36,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 19:04:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:36,147 INFO L225 Difference]: With dead ends: 701 [2019-12-18 19:04:36,148 INFO L226 Difference]: Without dead ends: 701 [2019-12-18 19:04:36,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:04:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-12-18 19:04:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 533. [2019-12-18 19:04:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-12-18 19:04:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 974 transitions. [2019-12-18 19:04:36,155 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 974 transitions. Word has length 52 [2019-12-18 19:04:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:36,156 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 974 transitions. [2019-12-18 19:04:36,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 974 transitions. [2019-12-18 19:04:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 19:04:36,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:36,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:36,158 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:36,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1092311168, now seen corresponding path program 2 times [2019-12-18 19:04:36,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:36,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038272522] [2019-12-18 19:04:36,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:36,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038272522] [2019-12-18 19:04:36,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:36,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:36,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407795071] [2019-12-18 19:04:36,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:36,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:36,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:36,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:36,225 INFO L87 Difference]: Start difference. First operand 533 states and 974 transitions. Second operand 3 states. [2019-12-18 19:04:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:36,236 INFO L93 Difference]: Finished difference Result 480 states and 854 transitions. [2019-12-18 19:04:36,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:36,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 19:04:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:36,237 INFO L225 Difference]: With dead ends: 480 [2019-12-18 19:04:36,237 INFO L226 Difference]: Without dead ends: 480 [2019-12-18 19:04:36,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-18 19:04:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-12-18 19:04:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-18 19:04:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 854 transitions. [2019-12-18 19:04:36,246 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 854 transitions. Word has length 52 [2019-12-18 19:04:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:36,246 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 854 transitions. [2019-12-18 19:04:36,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 854 transitions. [2019-12-18 19:04:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 19:04:36,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:36,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:36,248 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash 660947046, now seen corresponding path program 1 times [2019-12-18 19:04:36,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:36,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246586957] [2019-12-18 19:04:36,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:36,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246586957] [2019-12-18 19:04:36,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:36,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:36,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953479944] [2019-12-18 19:04:36,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:36,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:36,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:36,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:36,381 INFO L87 Difference]: Start difference. First operand 480 states and 854 transitions. Second operand 6 states. [2019-12-18 19:04:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:36,439 INFO L93 Difference]: Finished difference Result 815 states and 1453 transitions. [2019-12-18 19:04:36,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:36,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 19:04:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:36,441 INFO L225 Difference]: With dead ends: 815 [2019-12-18 19:04:36,441 INFO L226 Difference]: Without dead ends: 404 [2019-12-18 19:04:36,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:04:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-12-18 19:04:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 356. [2019-12-18 19:04:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-18 19:04:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 639 transitions. [2019-12-18 19:04:36,446 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 639 transitions. Word has length 53 [2019-12-18 19:04:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:36,447 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 639 transitions. [2019-12-18 19:04:36,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 639 transitions. [2019-12-18 19:04:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 19:04:36,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:36,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:36,448 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2062591520, now seen corresponding path program 2 times [2019-12-18 19:04:36,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:36,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041454325] [2019-12-18 19:04:36,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:36,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041454325] [2019-12-18 19:04:36,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:36,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:36,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404917337] [2019-12-18 19:04:36,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:36,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:36,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:36,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:36,508 INFO L87 Difference]: Start difference. First operand 356 states and 639 transitions. Second operand 3 states. [2019-12-18 19:04:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:36,548 INFO L93 Difference]: Finished difference Result 355 states and 637 transitions. [2019-12-18 19:04:36,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:36,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 19:04:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:36,549 INFO L225 Difference]: With dead ends: 355 [2019-12-18 19:04:36,549 INFO L226 Difference]: Without dead ends: 355 [2019-12-18 19:04:36,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-18 19:04:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 219. [2019-12-18 19:04:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-18 19:04:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-18 19:04:36,554 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 53 [2019-12-18 19:04:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:36,554 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-18 19:04:36,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-18 19:04:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:36,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:36,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:36,556 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:36,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:36,556 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 1 times [2019-12-18 19:04:36,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:36,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088296554] [2019-12-18 19:04:36,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:36,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088296554] [2019-12-18 19:04:36,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:36,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:04:36,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087415800] [2019-12-18 19:04:36,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:04:36,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:36,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:04:36,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:04:36,832 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 13 states. [2019-12-18 19:04:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:37,205 INFO L93 Difference]: Finished difference Result 384 states and 661 transitions. [2019-12-18 19:04:37,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:04:37,205 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 19:04:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:37,206 INFO L225 Difference]: With dead ends: 384 [2019-12-18 19:04:37,207 INFO L226 Difference]: Without dead ends: 353 [2019-12-18 19:04:37,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:04:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-12-18 19:04:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 319. [2019-12-18 19:04:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-18 19:04:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-18 19:04:37,212 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-18 19:04:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:37,212 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-18 19:04:37,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:04:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-18 19:04:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:37,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:37,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:37,213 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:37,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:37,213 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 2 times [2019-12-18 19:04:37,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:37,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621540279] [2019-12-18 19:04:37,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:37,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621540279] [2019-12-18 19:04:37,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:37,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:04:37,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906331098] [2019-12-18 19:04:37,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:04:37,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:37,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:04:37,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:04:37,426 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 12 states. [2019-12-18 19:04:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:37,901 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-12-18 19:04:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:04:37,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 19:04:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:37,902 INFO L225 Difference]: With dead ends: 420 [2019-12-18 19:04:37,903 INFO L226 Difference]: Without dead ends: 389 [2019-12-18 19:04:37,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:04:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-18 19:04:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2019-12-18 19:04:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 19:04:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-12-18 19:04:37,908 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-12-18 19:04:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:37,908 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-12-18 19:04:37,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:04:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-12-18 19:04:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:37,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:37,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:37,910 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:37,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 3 times [2019-12-18 19:04:37,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:37,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582782412] [2019-12-18 19:04:37,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:38,003 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:04:38,004 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:04:38,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| 4)) (= 0 |v_ULTIMATE.start_main_~#t2481~0.offset_16|) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= v_~y$r_buff1_thd0~0_304 0) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19|) 0) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2481~0.base_19|) (= v_~y$r_buff1_thd1~0_220 0) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19| 1)) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19|) |v_ULTIMATE.start_main_~#t2481~0.offset_16| 0)) |v_#memory_int_15|) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2481~0.offset=|v_ULTIMATE.start_main_~#t2481~0.offset_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_19|, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ULTIMATE.start_main_~#t2481~0.base=|v_ULTIMATE.start_main_~#t2481~0.base_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2481~0.offset, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2482~0.base, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2482~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ULTIMATE.start_main_~#t2481~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:04:38,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2482~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11|) |v_ULTIMATE.start_main_~#t2482~0.offset_10| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2482~0.base_11|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2482~0.offset_10|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| 4) |v_#length_9|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_10|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2482~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2482~0.base, #length] because there is no mapped edge [2019-12-18 19:04:38,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_P0Thread1of1ForFork0_~arg.offset_79 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_~y$w_buff0_used~0_290 1) (= 0 (mod v_~y$w_buff1_used~0_162 256)) (= v_P0Thread1of1ForFork0_~arg.base_79 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_79, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:04:38,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1821927128 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1821927128 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1821927128 |P0Thread1of1ForFork0_#t~ite5_Out-1821927128|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1821927128|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1821927128, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1821927128} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1821927128|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1821927128, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1821927128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 19:04:38,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1850628563 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1850628563 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1850628563| ~y~0_In-1850628563)) (and (= ~y$w_buff1~0_In-1850628563 |P1Thread1of1ForFork1_#t~ite9_Out-1850628563|) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1850628563, ~y$w_buff1~0=~y$w_buff1~0_In-1850628563, ~y~0=~y~0_In-1850628563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1850628563} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1850628563, ~y$w_buff1~0=~y$w_buff1~0_In-1850628563, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1850628563|, ~y~0=~y~0_In-1850628563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1850628563} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 19:04:38,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 19:04:38,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-988145225 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-988145225 256) 0))) (or (and (= ~y$w_buff0_used~0_In-988145225 |P1Thread1of1ForFork1_#t~ite11_Out-988145225|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-988145225|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-988145225, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-988145225} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-988145225, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-988145225, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-988145225|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 19:04:38,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2141151083 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2141151083 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In2141151083 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In2141151083 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2141151083 |P0Thread1of1ForFork0_#t~ite6_Out2141151083|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out2141151083| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2141151083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2141151083, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2141151083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2141151083} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2141151083|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2141151083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2141151083, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2141151083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2141151083} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 19:04:38,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-661801763 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-661801763 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-661801763 ~y$r_buff0_thd1~0_In-661801763)) (and (= ~y$r_buff0_thd1~0_Out-661801763 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-661801763, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-661801763} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-661801763, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-661801763|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-661801763} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 19:04:38,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1091176772 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1091176772 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1091176772 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1091176772 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1091176772|)) (and (= ~y$w_buff1_used~0_In1091176772 |P1Thread1of1ForFork1_#t~ite12_Out1091176772|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1091176772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1091176772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1091176772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1091176772} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1091176772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1091176772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1091176772, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1091176772|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1091176772} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 19:04:38,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1092046931 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1092046931 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1092046931| ~y$r_buff0_thd2~0_In1092046931)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1092046931| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1092046931, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1092046931} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1092046931, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1092046931, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1092046931|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 19:04:38,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-586894762 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-586894762 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-586894762 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-586894762 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-586894762| ~y$r_buff1_thd2~0_In-586894762) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-586894762| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-586894762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-586894762, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-586894762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-586894762} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-586894762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-586894762, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-586894762, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-586894762|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-586894762} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 19:04:38,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd2~0_85) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 19:04:38,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1656618006 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1656618006 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1656618006 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1656618006 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1656618006| ~y$r_buff1_thd1~0_In1656618006)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out1656618006| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1656618006, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1656618006, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1656618006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1656618006} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1656618006, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1656618006, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1656618006|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1656618006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1656618006} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 19:04:38,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 19:04:38,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 19:04:38,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In466364943 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In466364943 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In466364943 |ULTIMATE.start_main_#t~ite17_Out466364943|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out466364943| ~y$w_buff1~0_In466364943) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In466364943, ~y~0=~y~0_In466364943, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In466364943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466364943} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out466364943|, ~y$w_buff1~0=~y$w_buff1~0_In466364943, ~y~0=~y~0_In466364943, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In466364943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466364943} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 19:04:38,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 19:04:38,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-391616586 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-391616586 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-391616586 |ULTIMATE.start_main_#t~ite19_Out-391616586|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-391616586| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-391616586, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-391616586} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-391616586, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-391616586|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-391616586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 19:04:38,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1281438327 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1281438327 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1281438327 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1281438327 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1281438327 |ULTIMATE.start_main_#t~ite20_Out1281438327|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1281438327|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1281438327, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1281438327, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1281438327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1281438327} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1281438327, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1281438327, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1281438327|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1281438327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1281438327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 19:04:38,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In938977927 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In938977927 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out938977927|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out938977927| ~y$r_buff0_thd0~0_In938977927)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In938977927, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In938977927} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In938977927, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In938977927, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out938977927|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 19:04:38,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-659132759 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-659132759 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-659132759 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-659132759 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-659132759|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out-659132759| ~y$r_buff1_thd0~0_In-659132759) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-659132759, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-659132759, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-659132759, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-659132759} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-659132759, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-659132759, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-659132759, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-659132759|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-659132759} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 19:04:38,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-165941583 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-165941583| ~y$w_buff0_used~0_In-165941583) (not .cse0) (= |ULTIMATE.start_main_#t~ite34_In-165941583| |ULTIMATE.start_main_#t~ite34_Out-165941583|)) (and (= |ULTIMATE.start_main_#t~ite35_Out-165941583| |ULTIMATE.start_main_#t~ite34_Out-165941583|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-165941583 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-165941583 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-165941583 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-165941583 256)))) (= ~y$w_buff0_used~0_In-165941583 |ULTIMATE.start_main_#t~ite34_Out-165941583|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-165941583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-165941583, ~weak$$choice2~0=~weak$$choice2~0_In-165941583, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-165941583, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-165941583, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In-165941583|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-165941583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-165941583, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-165941583|, ~weak$$choice2~0=~weak$$choice2~0_In-165941583, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-165941583, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-165941583|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-165941583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 19:04:38,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 19:04:38,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:04:38,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 19:04:38,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:04:38 BasicIcfg [2019-12-18 19:04:38,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:04:38,125 INFO L168 Benchmark]: Toolchain (without parser) took 19068.13 ms. Allocated memory was 143.1 MB in the beginning and 833.6 MB in the end (delta: 690.5 MB). Free memory was 100.3 MB in the beginning and 620.3 MB in the end (delta: -520.0 MB). Peak memory consumption was 170.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:38,126 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 19:04:38,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.39 ms. Allocated memory was 143.1 MB in the beginning and 201.9 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 156.4 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:38,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.14 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:38,129 INFO L168 Benchmark]: Boogie Preprocessor took 37.64 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:38,131 INFO L168 Benchmark]: RCFGBuilder took 802.44 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 107.3 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:38,132 INFO L168 Benchmark]: TraceAbstraction took 17313.49 ms. Allocated memory was 201.9 MB in the beginning and 833.6 MB in the end (delta: 631.8 MB). Free memory was 106.6 MB in the beginning and 620.3 MB in the end (delta: -513.7 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:38,142 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.22 ms. Allocated memory is still 143.1 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 841.39 ms. Allocated memory was 143.1 MB in the beginning and 201.9 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 156.4 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.14 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.64 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.44 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 107.3 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17313.49 ms. Allocated memory was 201.9 MB in the beginning and 833.6 MB in the end (delta: 631.8 MB). Free memory was 106.6 MB in the beginning and 620.3 MB in the end (delta: -513.7 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2231 SDtfs, 1958 SDslu, 4971 SDs, 0 SdLazy, 3066 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15905occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 14583 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 586 ConstructedInterpolants, 0 QuantifiedInterpolants, 89050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...