/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/mix003_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:08:08,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:08:08,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:08:08,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:08:08,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:08:08,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:08:08,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:08:08,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:08:08,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:08:08,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:08:08,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:08:08,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:08:08,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:08:08,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:08:08,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:08:08,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:08:08,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:08:08,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:08:08,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:08:08,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:08:08,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:08:08,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:08:08,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:08:08,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:08:08,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:08:08,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:08:08,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:08:08,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:08:08,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:08:08,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:08:08,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:08:08,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:08:08,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:08:08,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:08:08,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:08:08,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:08:08,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:08:08,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:08:08,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:08:08,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:08:08,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:08:08,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:08:08,855 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:08:08,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:08:08,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:08:08,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:08:08,858 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:08:08,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:08:08,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:08:08,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:08:08,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:08:08,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:08:08,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:08:08,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:08:08,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:08:08,861 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:08:08,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:08:08,861 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:08:08,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:08:08,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:08:08,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:08:08,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:08:08,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:08:08,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:08:08,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:08:08,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:08:08,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:08:08,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:08:08,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:08:08,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:08:08,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:08:09,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:08:09,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:08:09,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:08:09,165 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:08:09,166 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:08:09,166 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i [2019-12-27 01:08:09,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0113ba921/ef63437b44354306a1a9bdf3fa741f5e/FLAG486ad9260 [2019-12-27 01:08:09,809 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:08:09,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i [2019-12-27 01:08:09,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0113ba921/ef63437b44354306a1a9bdf3fa741f5e/FLAG486ad9260 [2019-12-27 01:08:10,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0113ba921/ef63437b44354306a1a9bdf3fa741f5e [2019-12-27 01:08:10,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:08:10,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:08:10,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:08:10,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:08:10,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:08:10,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398e727f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10, skipping insertion in model container [2019-12-27 01:08:10,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:08:10,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:08:10,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:08:10,678 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:08:10,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:08:10,831 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:08:10,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10 WrapperNode [2019-12-27 01:08:10,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:08:10,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:08:10,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:08:10,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:08:10,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:08:10,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:08:10,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:08:10,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:08:10,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... [2019-12-27 01:08:10,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:08:10,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:08:10,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:08:10,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:08:10,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:08:11,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:08:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:08:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:08:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:08:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:08:11,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:08:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:08:11,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:08:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:08:11,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:08:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:08:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:08:11,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:08:11,020 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:08:11,783 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:08:11,783 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:08:11,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:08:11 BoogieIcfgContainer [2019-12-27 01:08:11,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:08:11,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:08:11,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:08:11,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:08:11,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:08:10" (1/3) ... [2019-12-27 01:08:11,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786ef67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:08:11, skipping insertion in model container [2019-12-27 01:08:11,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:08:10" (2/3) ... [2019-12-27 01:08:11,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786ef67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:08:11, skipping insertion in model container [2019-12-27 01:08:11,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:08:11" (3/3) ... [2019-12-27 01:08:11,793 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_tso.oepc.i [2019-12-27 01:08:11,802 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:08:11,802 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:08:11,809 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:08:11,811 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:08:11,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,853 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,888 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,888 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,916 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,918 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,926 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,926 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:08:11,945 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:08:11,966 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:08:11,966 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:08:11,967 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:08:11,967 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:08:11,967 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:08:11,967 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:08:11,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:08:11,967 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:08:11,985 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 01:08:11,987 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:08:12,092 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:08:12,092 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:08:12,112 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:08:12,140 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:08:12,198 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:08:12,198 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:08:12,207 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:08:12,234 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:08:12,235 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:08:17,522 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 01:08:17,652 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 01:08:17,975 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-27 01:08:17,976 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 01:08:17,980 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 01:08:39,567 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 01:08:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 01:08:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:08:39,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:39,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:08:39,576 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:39,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:39,581 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-27 01:08:39,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:39,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259246035] [2019-12-27 01:08:39,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:39,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259246035] [2019-12-27 01:08:39,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:39,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:08:39,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368820328] [2019-12-27 01:08:39,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:08:39,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:08:39,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:39,847 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 01:08:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:43,601 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-27 01:08:43,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:08:43,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:08:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:08:44,236 INFO L225 Difference]: With dead ends: 119613 [2019-12-27 01:08:44,237 INFO L226 Difference]: Without dead ends: 105755 [2019-12-27 01:08:44,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:08:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-27 01:08:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-27 01:08:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-27 01:08:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-27 01:08:55,790 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-27 01:08:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:08:55,790 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-27 01:08:55,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:08:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-27 01:08:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:08:55,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:08:55,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:08:55,795 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:08:55,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:08:55,796 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-27 01:08:55,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:08:55,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477686736] [2019-12-27 01:08:55,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:08:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:08:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:08:55,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477686736] [2019-12-27 01:08:55,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:08:55,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:08:55,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618318988] [2019-12-27 01:08:55,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:08:55,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:08:55,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:08:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:08:55,894 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-27 01:08:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:08:57,220 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-27 01:08:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:08:57,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:08:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:02,790 INFO L225 Difference]: With dead ends: 168845 [2019-12-27 01:09:02,791 INFO L226 Difference]: Without dead ends: 168747 [2019-12-27 01:09:02,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-27 01:09:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-27 01:09:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-27 01:09:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-27 01:09:12,253 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-27 01:09:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:12,254 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-27 01:09:12,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:09:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-27 01:09:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:09:12,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:12,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:12,261 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-27 01:09:12,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:12,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210698048] [2019-12-27 01:09:12,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:12,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210698048] [2019-12-27 01:09:12,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:12,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:09:12,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157226016] [2019-12-27 01:09:12,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:09:12,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:12,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:09:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:12,339 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-27 01:09:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:12,514 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-27 01:09:12,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:09:12,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:09:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:12,575 INFO L225 Difference]: With dead ends: 33476 [2019-12-27 01:09:12,575 INFO L226 Difference]: Without dead ends: 33476 [2019-12-27 01:09:12,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-27 01:09:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-27 01:09:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-27 01:09:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-27 01:09:13,245 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-27 01:09:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:13,245 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-27 01:09:13,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:09:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-27 01:09:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:09:13,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:13,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:13,250 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:13,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-27 01:09:13,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:13,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65078158] [2019-12-27 01:09:13,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:13,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65078158] [2019-12-27 01:09:13,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:13,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:09:13,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605958799] [2019-12-27 01:09:13,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:09:13,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:09:13,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:09:13,345 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-27 01:09:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:13,718 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-27 01:09:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:09:13,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:09:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:13,793 INFO L225 Difference]: With dead ends: 41508 [2019-12-27 01:09:13,793 INFO L226 Difference]: Without dead ends: 41508 [2019-12-27 01:09:13,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-27 01:09:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-27 01:09:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-27 01:09:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-27 01:09:14,971 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-27 01:09:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:14,972 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-27 01:09:14,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:09:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-27 01:09:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:09:14,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:14,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:14,975 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:14,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:14,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-27 01:09:14,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:14,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839941401] [2019-12-27 01:09:14,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:15,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839941401] [2019-12-27 01:09:15,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:15,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:09:15,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815531260] [2019-12-27 01:09:15,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:09:15,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:09:15,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:15,026 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-27 01:09:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:15,261 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-27 01:09:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:09:15,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:09:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:15,359 INFO L225 Difference]: With dead ends: 54855 [2019-12-27 01:09:15,359 INFO L226 Difference]: Without dead ends: 54855 [2019-12-27 01:09:15,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-27 01:09:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-27 01:09:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-27 01:09:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-27 01:09:16,759 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-27 01:09:16,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:16,759 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-27 01:09:16,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:09:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-27 01:09:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:09:16,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:16,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:16,763 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-27 01:09:16,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:16,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592575205] [2019-12-27 01:09:16,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:16,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592575205] [2019-12-27 01:09:16,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:16,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:09:16,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406578311] [2019-12-27 01:09:16,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:09:16,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:09:16,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:09:16,823 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-27 01:09:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:17,195 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-27 01:09:17,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:09:17,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:09:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:17,319 INFO L225 Difference]: With dead ends: 49903 [2019-12-27 01:09:17,320 INFO L226 Difference]: Without dead ends: 49903 [2019-12-27 01:09:17,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-27 01:09:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-27 01:09:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-27 01:09:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-27 01:09:18,104 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-27 01:09:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:18,105 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-27 01:09:18,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:09:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-27 01:09:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:09:18,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:18,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:18,115 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-27 01:09:18,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:18,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143370540] [2019-12-27 01:09:18,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:18,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143370540] [2019-12-27 01:09:18,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:18,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:09:18,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539551890] [2019-12-27 01:09:18,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:09:18,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:18,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:09:18,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:18,231 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 5 states. [2019-12-27 01:09:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:18,946 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-27 01:09:18,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:09:18,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:09:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:19,053 INFO L225 Difference]: With dead ends: 59763 [2019-12-27 01:09:19,054 INFO L226 Difference]: Without dead ends: 59749 [2019-12-27 01:09:19,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:09:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-27 01:09:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-27 01:09:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-27 01:09:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-27 01:09:20,347 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-27 01:09:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:20,347 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-27 01:09:20,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:09:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-27 01:09:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:09:20,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:20,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:20,356 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-27 01:09:20,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:20,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191705816] [2019-12-27 01:09:20,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:20,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191705816] [2019-12-27 01:09:20,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:20,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:09:20,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581932393] [2019-12-27 01:09:20,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:09:20,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:20,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:09:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:20,437 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 5 states. [2019-12-27 01:09:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:21,150 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-27 01:09:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:09:21,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:09:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:21,260 INFO L225 Difference]: With dead ends: 62779 [2019-12-27 01:09:21,261 INFO L226 Difference]: Without dead ends: 62765 [2019-12-27 01:09:21,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:09:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-27 01:09:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-27 01:09:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-27 01:09:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-27 01:09:22,796 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-27 01:09:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:22,796 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-27 01:09:22,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:09:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-27 01:09:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:09:22,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:22,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:22,808 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:22,808 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-27 01:09:22,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:22,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658063759] [2019-12-27 01:09:22,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:22,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658063759] [2019-12-27 01:09:22,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:22,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:09:22,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698706482] [2019-12-27 01:09:22,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:09:22,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:22,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:09:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:09:22,881 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 4 states. [2019-12-27 01:09:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:22,978 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-27 01:09:22,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:09:22,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:09:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:23,014 INFO L225 Difference]: With dead ends: 17503 [2019-12-27 01:09:23,014 INFO L226 Difference]: Without dead ends: 17503 [2019-12-27 01:09:23,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:09:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-27 01:09:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-27 01:09:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-27 01:09:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-27 01:09:23,287 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-27 01:09:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:23,288 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-27 01:09:23,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:09:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-27 01:09:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:09:23,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:23,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:23,302 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:23,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:23,303 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-27 01:09:23,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:23,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707447869] [2019-12-27 01:09:23,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:23,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707447869] [2019-12-27 01:09:23,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:23,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:09:23,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790787232] [2019-12-27 01:09:23,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:09:23,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:09:23,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:23,351 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-27 01:09:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:23,480 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-27 01:09:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:09:23,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 01:09:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:23,519 INFO L225 Difference]: With dead ends: 22571 [2019-12-27 01:09:23,519 INFO L226 Difference]: Without dead ends: 22571 [2019-12-27 01:09:23,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-27 01:09:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-27 01:09:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-27 01:09:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-27 01:09:23,813 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-27 01:09:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:23,813 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-27 01:09:23,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:09:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-27 01:09:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:09:23,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:23,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:23,827 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:23,827 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-27 01:09:23,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:23,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285115953] [2019-12-27 01:09:23,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:23,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285115953] [2019-12-27 01:09:23,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:23,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:09:23,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590976768] [2019-12-27 01:09:23,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:09:23,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:23,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:09:23,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:23,930 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-27 01:09:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:24,313 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-27 01:09:24,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:09:24,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 01:09:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:24,343 INFO L225 Difference]: With dead ends: 21146 [2019-12-27 01:09:24,343 INFO L226 Difference]: Without dead ends: 21146 [2019-12-27 01:09:24,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:09:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-27 01:09:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-27 01:09:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-27 01:09:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-27 01:09:24,647 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-27 01:09:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:24,647 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-27 01:09:24,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:09:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-27 01:09:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:09:24,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:24,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:24,662 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:24,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-27 01:09:24,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:24,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601739838] [2019-12-27 01:09:24,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:24,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601739838] [2019-12-27 01:09:24,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:24,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:09:24,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010380928] [2019-12-27 01:09:24,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:09:24,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:09:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:24,726 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-27 01:09:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:25,081 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-27 01:09:25,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:09:25,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:09:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:25,112 INFO L225 Difference]: With dead ends: 23192 [2019-12-27 01:09:25,112 INFO L226 Difference]: Without dead ends: 23192 [2019-12-27 01:09:25,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:09:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-27 01:09:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-27 01:09:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-27 01:09:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-27 01:09:25,426 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-27 01:09:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:25,426 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-27 01:09:25,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:09:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-27 01:09:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:09:25,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:25,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:25,759 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:25,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:25,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-27 01:09:25,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:25,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530127443] [2019-12-27 01:09:25,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:25,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530127443] [2019-12-27 01:09:25,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:25,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:09:25,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697595947] [2019-12-27 01:09:25,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:09:25,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:09:25,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:09:25,864 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 6 states. [2019-12-27 01:09:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:26,576 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-27 01:09:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:09:26,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 01:09:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:26,614 INFO L225 Difference]: With dead ends: 26785 [2019-12-27 01:09:26,614 INFO L226 Difference]: Without dead ends: 26785 [2019-12-27 01:09:26,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:09:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-27 01:09:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-27 01:09:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-27 01:09:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-27 01:09:26,969 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-27 01:09:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:26,969 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-27 01:09:26,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:09:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-27 01:09:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:09:26,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:26,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] [2019-12-27 01:09:26,992 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:26,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:26,992 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-27 01:09:26,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:26,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095973682] [2019-12-27 01:09:26,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:27,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095973682] [2019-12-27 01:09:27,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:27,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:09:27,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661382143] [2019-12-27 01:09:27,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:09:27,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:09:27,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:09:27,088 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 6 states. [2019-12-27 01:09:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:27,847 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-27 01:09:27,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:09:27,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 01:09:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:27,884 INFO L225 Difference]: With dead ends: 25915 [2019-12-27 01:09:27,884 INFO L226 Difference]: Without dead ends: 25915 [2019-12-27 01:09:27,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:09:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-27 01:09:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-27 01:09:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-27 01:09:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-27 01:09:28,203 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-27 01:09:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:28,203 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-27 01:09:28,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:09:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-27 01:09:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:09:28,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:28,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:28,222 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-27 01:09:28,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:28,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843967136] [2019-12-27 01:09:28,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:28,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843967136] [2019-12-27 01:09:28,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:28,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:09:28,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271333955] [2019-12-27 01:09:28,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:09:28,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:28,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:09:28,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:28,280 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-27 01:09:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:28,342 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-27 01:09:28,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:09:28,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:09:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:28,377 INFO L225 Difference]: With dead ends: 17953 [2019-12-27 01:09:28,378 INFO L226 Difference]: Without dead ends: 17953 [2019-12-27 01:09:28,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-27 01:09:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-27 01:09:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-27 01:09:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-27 01:09:28,651 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-27 01:09:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:28,652 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-27 01:09:28,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:09:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-27 01:09:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:09:28,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:28,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:28,668 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-27 01:09:28,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:28,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499115421] [2019-12-27 01:09:28,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:28,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499115421] [2019-12-27 01:09:28,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:28,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:09:28,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289792205] [2019-12-27 01:09:28,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:09:28,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:28,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:09:28,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:28,759 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 3 states. [2019-12-27 01:09:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:28,845 INFO L93 Difference]: Finished difference Result 17953 states and 53342 transitions. [2019-12-27 01:09:28,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:09:28,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 01:09:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:28,879 INFO L225 Difference]: With dead ends: 17953 [2019-12-27 01:09:28,880 INFO L226 Difference]: Without dead ends: 17953 [2019-12-27 01:09:28,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-27 01:09:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 16037. [2019-12-27 01:09:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16037 states. [2019-12-27 01:09:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16037 states to 16037 states and 48092 transitions. [2019-12-27 01:09:29,264 INFO L78 Accepts]: Start accepts. Automaton has 16037 states and 48092 transitions. Word has length 40 [2019-12-27 01:09:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:29,265 INFO L462 AbstractCegarLoop]: Abstraction has 16037 states and 48092 transitions. [2019-12-27 01:09:29,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:09:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16037 states and 48092 transitions. [2019-12-27 01:09:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 01:09:29,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:29,287 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-27 01:09:29,287 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:29,288 INFO L82 PathProgramCache]: Analyzing trace with hash -935567252, now seen corresponding path program 1 times [2019-12-27 01:09:29,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:29,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118512277] [2019-12-27 01:09:29,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:29,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118512277] [2019-12-27 01:09:29,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:29,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:09:29,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726962404] [2019-12-27 01:09:29,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:09:29,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:29,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:09:29,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:29,363 INFO L87 Difference]: Start difference. First operand 16037 states and 48092 transitions. Second operand 5 states. [2019-12-27 01:09:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:29,658 INFO L93 Difference]: Finished difference Result 14868 states and 45573 transitions. [2019-12-27 01:09:29,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:09:29,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 01:09:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:29,685 INFO L225 Difference]: With dead ends: 14868 [2019-12-27 01:09:29,685 INFO L226 Difference]: Without dead ends: 14868 [2019-12-27 01:09:29,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14868 states. [2019-12-27 01:09:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14868 to 14868. [2019-12-27 01:09:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14868 states. [2019-12-27 01:09:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14868 states to 14868 states and 45573 transitions. [2019-12-27 01:09:29,925 INFO L78 Accepts]: Start accepts. Automaton has 14868 states and 45573 transitions. Word has length 41 [2019-12-27 01:09:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:29,925 INFO L462 AbstractCegarLoop]: Abstraction has 14868 states and 45573 transitions. [2019-12-27 01:09:29,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:09:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 14868 states and 45573 transitions. [2019-12-27 01:09:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:09:29,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:29,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:29,948 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash -344664589, now seen corresponding path program 1 times [2019-12-27 01:09:29,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:29,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050687616] [2019-12-27 01:09:29,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:30,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050687616] [2019-12-27 01:09:30,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:30,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:09:30,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908859448] [2019-12-27 01:09:30,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:09:30,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:09:30,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:09:30,054 INFO L87 Difference]: Start difference. First operand 14868 states and 45573 transitions. Second operand 7 states. [2019-12-27 01:09:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:30,566 INFO L93 Difference]: Finished difference Result 43451 states and 132340 transitions. [2019-12-27 01:09:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:09:30,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:09:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:30,613 INFO L225 Difference]: With dead ends: 43451 [2019-12-27 01:09:30,613 INFO L226 Difference]: Without dead ends: 33731 [2019-12-27 01:09:30,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:09:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33731 states. [2019-12-27 01:09:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33731 to 18516. [2019-12-27 01:09:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18516 states. [2019-12-27 01:09:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18516 states to 18516 states and 56848 transitions. [2019-12-27 01:09:31,028 INFO L78 Accepts]: Start accepts. Automaton has 18516 states and 56848 transitions. Word has length 65 [2019-12-27 01:09:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:31,028 INFO L462 AbstractCegarLoop]: Abstraction has 18516 states and 56848 transitions. [2019-12-27 01:09:31,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:09:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 18516 states and 56848 transitions. [2019-12-27 01:09:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:09:31,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:31,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:31,055 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:31,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1662753005, now seen corresponding path program 2 times [2019-12-27 01:09:31,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:31,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675760550] [2019-12-27 01:09:31,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:31,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675760550] [2019-12-27 01:09:31,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:31,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:09:31,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785623279] [2019-12-27 01:09:31,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:09:31,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:09:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:09:31,141 INFO L87 Difference]: Start difference. First operand 18516 states and 56848 transitions. Second operand 7 states. [2019-12-27 01:09:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:31,645 INFO L93 Difference]: Finished difference Result 49218 states and 148223 transitions. [2019-12-27 01:09:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:09:31,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:09:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:31,697 INFO L225 Difference]: With dead ends: 49218 [2019-12-27 01:09:31,697 INFO L226 Difference]: Without dead ends: 35999 [2019-12-27 01:09:31,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:09:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35999 states. [2019-12-27 01:09:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35999 to 21947. [2019-12-27 01:09:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21947 states. [2019-12-27 01:09:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21947 states to 21947 states and 66970 transitions. [2019-12-27 01:09:32,147 INFO L78 Accepts]: Start accepts. Automaton has 21947 states and 66970 transitions. Word has length 65 [2019-12-27 01:09:32,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:32,147 INFO L462 AbstractCegarLoop]: Abstraction has 21947 states and 66970 transitions. [2019-12-27 01:09:32,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:09:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 21947 states and 66970 transitions. [2019-12-27 01:09:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:09:32,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:32,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:32,169 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1251052155, now seen corresponding path program 3 times [2019-12-27 01:09:32,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:32,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157711942] [2019-12-27 01:09:32,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:32,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157711942] [2019-12-27 01:09:32,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:32,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:09:32,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910478967] [2019-12-27 01:09:32,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:09:32,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:09:32,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:09:32,256 INFO L87 Difference]: Start difference. First operand 21947 states and 66970 transitions. Second operand 7 states. [2019-12-27 01:09:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:32,669 INFO L93 Difference]: Finished difference Result 42421 states and 127518 transitions. [2019-12-27 01:09:32,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:09:32,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:09:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:32,726 INFO L225 Difference]: With dead ends: 42421 [2019-12-27 01:09:32,726 INFO L226 Difference]: Without dead ends: 39710 [2019-12-27 01:09:32,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:09:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39710 states. [2019-12-27 01:09:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39710 to 22043. [2019-12-27 01:09:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22043 states. [2019-12-27 01:09:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22043 states to 22043 states and 67314 transitions. [2019-12-27 01:09:33,501 INFO L78 Accepts]: Start accepts. Automaton has 22043 states and 67314 transitions. Word has length 65 [2019-12-27 01:09:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:33,501 INFO L462 AbstractCegarLoop]: Abstraction has 22043 states and 67314 transitions. [2019-12-27 01:09:33,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:09:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 22043 states and 67314 transitions. [2019-12-27 01:09:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:09:33,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:33,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:33,527 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1414187811, now seen corresponding path program 4 times [2019-12-27 01:09:33,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:33,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350674876] [2019-12-27 01:09:33,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:33,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350674876] [2019-12-27 01:09:33,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:33,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:09:33,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615951480] [2019-12-27 01:09:33,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:09:33,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:33,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:09:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:33,593 INFO L87 Difference]: Start difference. First operand 22043 states and 67314 transitions. Second operand 3 states. [2019-12-27 01:09:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:33,761 INFO L93 Difference]: Finished difference Result 25110 states and 76797 transitions. [2019-12-27 01:09:33,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:09:33,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:09:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:33,822 INFO L225 Difference]: With dead ends: 25110 [2019-12-27 01:09:33,822 INFO L226 Difference]: Without dead ends: 25110 [2019-12-27 01:09:33,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25110 states. [2019-12-27 01:09:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25110 to 20735. [2019-12-27 01:09:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-27 01:09:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 64104 transitions. [2019-12-27 01:09:34,324 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 64104 transitions. Word has length 65 [2019-12-27 01:09:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:34,325 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 64104 transitions. [2019-12-27 01:09:34,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:09:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 64104 transitions. [2019-12-27 01:09:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:09:34,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:34,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:34,349 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1928104461, now seen corresponding path program 1 times [2019-12-27 01:09:34,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:34,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101893072] [2019-12-27 01:09:34,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:34,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-27 01:09:34,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101893072] [2019-12-27 01:09:34,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:34,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:09:34,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710753232] [2019-12-27 01:09:34,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:09:34,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:34,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:09:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:09:34,427 INFO L87 Difference]: Start difference. First operand 20735 states and 64104 transitions. Second operand 7 states. [2019-12-27 01:09:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:34,907 INFO L93 Difference]: Finished difference Result 43564 states and 133585 transitions. [2019-12-27 01:09:34,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:09:34,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 01:09:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:34,965 INFO L225 Difference]: With dead ends: 43564 [2019-12-27 01:09:34,965 INFO L226 Difference]: Without dead ends: 40319 [2019-12-27 01:09:34,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:09:35,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40319 states. [2019-12-27 01:09:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40319 to 20867. [2019-12-27 01:09:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20867 states. [2019-12-27 01:09:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20867 states to 20867 states and 64616 transitions. [2019-12-27 01:09:35,435 INFO L78 Accepts]: Start accepts. Automaton has 20867 states and 64616 transitions. Word has length 66 [2019-12-27 01:09:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:35,435 INFO L462 AbstractCegarLoop]: Abstraction has 20867 states and 64616 transitions. [2019-12-27 01:09:35,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:09:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20867 states and 64616 transitions. [2019-12-27 01:09:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:09:35,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:35,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:35,458 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash 104538735, now seen corresponding path program 2 times [2019-12-27 01:09:35,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:35,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285872241] [2019-12-27 01:09:35,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:35,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285872241] [2019-12-27 01:09:35,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:35,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:09:35,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078822029] [2019-12-27 01:09:35,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:09:35,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:09:35,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:09:35,530 INFO L87 Difference]: Start difference. First operand 20867 states and 64616 transitions. Second operand 4 states. [2019-12-27 01:09:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:35,697 INFO L93 Difference]: Finished difference Result 20682 states and 63880 transitions. [2019-12-27 01:09:35,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:09:35,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 01:09:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:35,731 INFO L225 Difference]: With dead ends: 20682 [2019-12-27 01:09:35,731 INFO L226 Difference]: Without dead ends: 20682 [2019-12-27 01:09:35,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:09:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20682 states. [2019-12-27 01:09:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20682 to 19455. [2019-12-27 01:09:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19455 states. [2019-12-27 01:09:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19455 states to 19455 states and 60082 transitions. [2019-12-27 01:09:36,045 INFO L78 Accepts]: Start accepts. Automaton has 19455 states and 60082 transitions. Word has length 66 [2019-12-27 01:09:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:36,046 INFO L462 AbstractCegarLoop]: Abstraction has 19455 states and 60082 transitions. [2019-12-27 01:09:36,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:09:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 19455 states and 60082 transitions. [2019-12-27 01:09:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:09:36,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:36,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:36,397 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:36,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:36,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1162997979, now seen corresponding path program 1 times [2019-12-27 01:09:36,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:36,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480032678] [2019-12-27 01:09:36,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:36,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480032678] [2019-12-27 01:09:36,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:36,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:09:36,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841842006] [2019-12-27 01:09:36,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:09:36,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:36,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:09:36,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:36,450 INFO L87 Difference]: Start difference. First operand 19455 states and 60082 transitions. Second operand 3 states. [2019-12-27 01:09:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:36,522 INFO L93 Difference]: Finished difference Result 16709 states and 50483 transitions. [2019-12-27 01:09:36,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:09:36,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:09:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:36,549 INFO L225 Difference]: With dead ends: 16709 [2019-12-27 01:09:36,549 INFO L226 Difference]: Without dead ends: 16709 [2019-12-27 01:09:36,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:09:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16709 states. [2019-12-27 01:09:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16709 to 15085. [2019-12-27 01:09:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15085 states. [2019-12-27 01:09:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15085 states to 15085 states and 45535 transitions. [2019-12-27 01:09:36,778 INFO L78 Accepts]: Start accepts. Automaton has 15085 states and 45535 transitions. Word has length 66 [2019-12-27 01:09:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:36,778 INFO L462 AbstractCegarLoop]: Abstraction has 15085 states and 45535 transitions. [2019-12-27 01:09:36,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:09:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15085 states and 45535 transitions. [2019-12-27 01:09:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:36,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:36,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:36,794 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash -543525966, now seen corresponding path program 1 times [2019-12-27 01:09:36,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:36,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44145600] [2019-12-27 01:09:36,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:37,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44145600] [2019-12-27 01:09:37,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:37,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:09:37,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971209762] [2019-12-27 01:09:37,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:09:37,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:37,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:09:37,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:09:37,033 INFO L87 Difference]: Start difference. First operand 15085 states and 45535 transitions. Second operand 10 states. [2019-12-27 01:09:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:38,417 INFO L93 Difference]: Finished difference Result 22528 states and 67687 transitions. [2019-12-27 01:09:38,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:09:38,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:09:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:38,460 INFO L225 Difference]: With dead ends: 22528 [2019-12-27 01:09:38,460 INFO L226 Difference]: Without dead ends: 18655 [2019-12-27 01:09:38,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:09:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18655 states. [2019-12-27 01:09:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18655 to 15486. [2019-12-27 01:09:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-27 01:09:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46650 transitions. [2019-12-27 01:09:38,900 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46650 transitions. Word has length 67 [2019-12-27 01:09:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:38,900 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46650 transitions. [2019-12-27 01:09:38,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:09:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46650 transitions. [2019-12-27 01:09:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:38,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:38,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:38,924 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1737332378, now seen corresponding path program 2 times [2019-12-27 01:09:38,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:38,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118071745] [2019-12-27 01:09:38,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:39,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118071745] [2019-12-27 01:09:39,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:39,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:09:39,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176307756] [2019-12-27 01:09:39,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:09:39,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:39,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:09:39,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:09:39,120 INFO L87 Difference]: Start difference. First operand 15486 states and 46650 transitions. Second operand 11 states. [2019-12-27 01:09:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:40,474 INFO L93 Difference]: Finished difference Result 20850 states and 62350 transitions. [2019-12-27 01:09:40,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:09:40,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:09:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:40,501 INFO L225 Difference]: With dead ends: 20850 [2019-12-27 01:09:40,501 INFO L226 Difference]: Without dead ends: 18415 [2019-12-27 01:09:40,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:09:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18415 states. [2019-12-27 01:09:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18415 to 15406. [2019-12-27 01:09:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15406 states. [2019-12-27 01:09:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15406 states to 15406 states and 46410 transitions. [2019-12-27 01:09:40,759 INFO L78 Accepts]: Start accepts. Automaton has 15406 states and 46410 transitions. Word has length 67 [2019-12-27 01:09:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:40,760 INFO L462 AbstractCegarLoop]: Abstraction has 15406 states and 46410 transitions. [2019-12-27 01:09:40,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:09:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 15406 states and 46410 transitions. [2019-12-27 01:09:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:40,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:40,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:40,775 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:40,776 INFO L82 PathProgramCache]: Analyzing trace with hash 202288426, now seen corresponding path program 3 times [2019-12-27 01:09:40,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:40,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188604159] [2019-12-27 01:09:40,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:40,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188604159] [2019-12-27 01:09:40,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:40,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:09:40,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887375934] [2019-12-27 01:09:40,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:09:40,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:40,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:09:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:09:40,951 INFO L87 Difference]: Start difference. First operand 15406 states and 46410 transitions. Second operand 10 states. [2019-12-27 01:09:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:42,293 INFO L93 Difference]: Finished difference Result 23323 states and 69368 transitions. [2019-12-27 01:09:42,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:09:42,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:09:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:42,321 INFO L225 Difference]: With dead ends: 23323 [2019-12-27 01:09:42,322 INFO L226 Difference]: Without dead ends: 19998 [2019-12-27 01:09:42,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:09:42,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2019-12-27 01:09:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 15790. [2019-12-27 01:09:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-27 01:09:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 47396 transitions. [2019-12-27 01:09:42,868 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 47396 transitions. Word has length 67 [2019-12-27 01:09:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:42,868 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 47396 transitions. [2019-12-27 01:09:42,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:09:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 47396 transitions. [2019-12-27 01:09:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:42,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:42,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:42,883 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 4 times [2019-12-27 01:09:42,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:42,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254018693] [2019-12-27 01:09:42,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:43,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254018693] [2019-12-27 01:09:43,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:43,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:09:43,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678683718] [2019-12-27 01:09:43,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:09:43,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:09:43,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:09:43,039 INFO L87 Difference]: Start difference. First operand 15790 states and 47396 transitions. Second operand 11 states. [2019-12-27 01:09:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:44,480 INFO L93 Difference]: Finished difference Result 22253 states and 66116 transitions. [2019-12-27 01:09:44,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:09:44,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:09:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:44,507 INFO L225 Difference]: With dead ends: 22253 [2019-12-27 01:09:44,508 INFO L226 Difference]: Without dead ends: 19642 [2019-12-27 01:09:44,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:09:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2019-12-27 01:09:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 15486. [2019-12-27 01:09:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-27 01:09:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46480 transitions. [2019-12-27 01:09:44,773 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46480 transitions. Word has length 67 [2019-12-27 01:09:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:44,773 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46480 transitions. [2019-12-27 01:09:44,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:09:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46480 transitions. [2019-12-27 01:09:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:44,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:44,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:44,790 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:44,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:44,790 INFO L82 PathProgramCache]: Analyzing trace with hash 668274002, now seen corresponding path program 5 times [2019-12-27 01:09:44,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:44,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148918280] [2019-12-27 01:09:44,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:44,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148918280] [2019-12-27 01:09:44,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:44,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:09:44,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075125827] [2019-12-27 01:09:44,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:09:44,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:44,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:09:44,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:09:44,939 INFO L87 Difference]: Start difference. First operand 15486 states and 46480 transitions. Second operand 11 states. [2019-12-27 01:09:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:46,109 INFO L93 Difference]: Finished difference Result 32811 states and 97292 transitions. [2019-12-27 01:09:46,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 01:09:46,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:09:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:46,145 INFO L225 Difference]: With dead ends: 32811 [2019-12-27 01:09:46,145 INFO L226 Difference]: Without dead ends: 26102 [2019-12-27 01:09:46,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 01:09:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26102 states. [2019-12-27 01:09:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26102 to 14741. [2019-12-27 01:09:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14741 states. [2019-12-27 01:09:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14741 states to 14741 states and 44134 transitions. [2019-12-27 01:09:46,450 INFO L78 Accepts]: Start accepts. Automaton has 14741 states and 44134 transitions. Word has length 67 [2019-12-27 01:09:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:46,451 INFO L462 AbstractCegarLoop]: Abstraction has 14741 states and 44134 transitions. [2019-12-27 01:09:46,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:09:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 14741 states and 44134 transitions. [2019-12-27 01:09:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:46,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:46,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:46,466 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 6 times [2019-12-27 01:09:46,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:46,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833322430] [2019-12-27 01:09:46,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:09:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:09:46,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833322430] [2019-12-27 01:09:46,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:09:46,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:09:46,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270934931] [2019-12-27 01:09:46,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:09:46,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:09:46,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:09:46,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:09:46,659 INFO L87 Difference]: Start difference. First operand 14741 states and 44134 transitions. Second operand 12 states. [2019-12-27 01:09:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:09:47,605 INFO L93 Difference]: Finished difference Result 26120 states and 77470 transitions. [2019-12-27 01:09:47,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:09:47,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:09:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:09:47,640 INFO L225 Difference]: With dead ends: 26120 [2019-12-27 01:09:47,640 INFO L226 Difference]: Without dead ends: 25905 [2019-12-27 01:09:47,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:09:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25905 states. [2019-12-27 01:09:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25905 to 14565. [2019-12-27 01:09:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14565 states. [2019-12-27 01:09:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14565 states to 14565 states and 43650 transitions. [2019-12-27 01:09:47,944 INFO L78 Accepts]: Start accepts. Automaton has 14565 states and 43650 transitions. Word has length 67 [2019-12-27 01:09:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:09:47,945 INFO L462 AbstractCegarLoop]: Abstraction has 14565 states and 43650 transitions. [2019-12-27 01:09:47,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:09:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 14565 states and 43650 transitions. [2019-12-27 01:09:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:09:47,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:09:47,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:09:47,960 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:09:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:09:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 7 times [2019-12-27 01:09:47,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:09:47,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329404785] [2019-12-27 01:09:47,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:09:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:09:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:09:48,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:09:48,099 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:09:48,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t83~0.offset_23|) (= v_~z$r_buff0_thd2~0_185 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32|) |v_ULTIMATE.start_main_~#t83~0.offset_23| 0)) |v_#memory_int_21|) (= 0 v_~x~0_134) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t83~0.base_32|) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32| 1)) (= v_~z~0_178 0) (= v_~z$r_buff1_thd0~0_195 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t83~0.base_32| 4) |v_#length_23|) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= v_~z$w_buff1~0_222 0) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32|)) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t83~0.base=|v_ULTIMATE.start_main_~#t83~0.base_32|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_29|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_22|, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t83~0.offset=|v_ULTIMATE.start_main_~#t83~0.offset_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t83~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t85~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t84~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t85~0.base, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t83~0.offset, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:09:48,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (= ~z$r_buff1_thd1~0_Out-1393615232 ~z$r_buff0_thd1~0_In-1393615232) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1393615232)) (= ~x~0_In-1393615232 ~__unbuffered_p0_EAX~0_Out-1393615232) (= ~z$r_buff0_thd0~0_In-1393615232 ~z$r_buff1_thd0~0_Out-1393615232) (= 1 ~z$r_buff0_thd1~0_Out-1393615232) (= ~z$r_buff0_thd3~0_In-1393615232 ~z$r_buff1_thd3~0_Out-1393615232) (= ~z$r_buff1_thd2~0_Out-1393615232 ~z$r_buff0_thd2~0_In-1393615232)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393615232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1393615232, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1393615232, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1393615232, ~x~0=~x~0_In-1393615232, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1393615232} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1393615232, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393615232, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1393615232, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1393615232, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1393615232, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1393615232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1393615232, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1393615232, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1393615232, ~x~0=~x~0_In-1393615232, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1393615232} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:09:48,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t84~0.offset_10| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t84~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t84~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t84~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11|) |v_ULTIMATE.start_main_~#t84~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t84~0.offset] because there is no mapped edge [2019-12-27 01:09:48,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1031841554 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-1031841554| |P1Thread1of1ForFork2_#t~ite10_Out-1031841554|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1031841554 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1031841554| ~z~0_In-1031841554) (or .cse0 .cse1) .cse2) (and (not .cse0) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-1031841554| ~z$w_buff1~0_In-1031841554) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1031841554, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1031841554, ~z$w_buff1~0=~z$w_buff1~0_In-1031841554, ~z~0=~z~0_In-1031841554} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1031841554|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1031841554, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1031841554|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1031841554, ~z$w_buff1~0=~z$w_buff1~0_In-1031841554, ~z~0=~z~0_In-1031841554} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:09:48,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1638419738 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1638419738 256) 0))) (or (and (= ~z$w_buff0_used~0_In1638419738 |P1Thread1of1ForFork2_#t~ite11_Out1638419738|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1638419738|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1638419738, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1638419738} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1638419738, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1638419738|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1638419738} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:09:48,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t85~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t85~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11|) |v_ULTIMATE.start_main_~#t85~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t85~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t85~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t85~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t85~0.offset] because there is no mapped edge [2019-12-27 01:09:48,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1257051996 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1257051996 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1257051996| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1257051996 |P0Thread1of1ForFork1_#t~ite5_Out1257051996|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1257051996, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1257051996} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1257051996|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1257051996, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1257051996} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:09:48,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1310148038 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1310148038 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1310148038 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1310148038 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1310148038| ~z$w_buff1_used~0_In-1310148038)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1310148038| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1310148038, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1310148038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1310148038, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1310148038} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1310148038, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1310148038|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1310148038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1310148038, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1310148038} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:09:48,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1263051736 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1263051736 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1263051736) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In1263051736 ~z$r_buff0_thd1~0_Out1263051736)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1263051736, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1263051736} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1263051736, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1263051736|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1263051736} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:09:48,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In384933130 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In384933130 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In384933130 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In384933130 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out384933130|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out384933130| ~z$r_buff1_thd1~0_In384933130) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In384933130, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In384933130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In384933130, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In384933130} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out384933130|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In384933130, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In384933130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In384933130, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In384933130} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:09:48,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:09:48,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-19927260 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-19927260 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-19927260 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-19927260 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-19927260| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite12_Out-19927260| ~z$w_buff1_used~0_In-19927260) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-19927260, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-19927260, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-19927260, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-19927260} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-19927260, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-19927260, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-19927260, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-19927260|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-19927260} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:09:48,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2145250004 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2145250004 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-2145250004| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-2145250004 |P1Thread1of1ForFork2_#t~ite13_Out-2145250004|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2145250004, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2145250004} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2145250004, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2145250004|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2145250004} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:09:48,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In241644208 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In241644208 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In241644208 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In241644208 256)))) (or (and (= ~z$r_buff1_thd2~0_In241644208 |P1Thread1of1ForFork2_#t~ite14_Out241644208|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out241644208|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In241644208, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In241644208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In241644208, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In241644208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In241644208, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In241644208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In241644208, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out241644208|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In241644208} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:09:48,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:09:48,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In607716150 256)))) (or (and (= ~z$w_buff1_used~0_In607716150 |P2Thread1of1ForFork0_#t~ite29_Out607716150|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In607716150 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In607716150 256) 0) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In607716150 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In607716150 256)))) (= |P2Thread1of1ForFork0_#t~ite29_Out607716150| |P2Thread1of1ForFork0_#t~ite30_Out607716150|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite29_In607716150| |P2Thread1of1ForFork0_#t~ite29_Out607716150|) (not .cse1) (= ~z$w_buff1_used~0_In607716150 |P2Thread1of1ForFork0_#t~ite30_Out607716150|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In607716150, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In607716150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In607716150, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In607716150, ~weak$$choice2~0=~weak$$choice2~0_In607716150, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In607716150|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In607716150, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In607716150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In607716150, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In607716150, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out607716150|, ~weak$$choice2~0=~weak$$choice2~0_In607716150, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out607716150|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:09:48,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:09:48,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:09:48,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1162169460 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1162169460 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1162169460| ~z$w_buff1~0_In-1162169460)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1162169460| ~z~0_In-1162169460) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1162169460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1162169460, ~z$w_buff1~0=~z$w_buff1~0_In-1162169460, ~z~0=~z~0_In-1162169460} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1162169460|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1162169460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1162169460, ~z$w_buff1~0=~z$w_buff1~0_In-1162169460, ~z~0=~z~0_In-1162169460} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:09:48,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 01:09:48,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1977556175 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1977556175 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1977556175| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1977556175 |P2Thread1of1ForFork0_#t~ite40_Out1977556175|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1977556175, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1977556175} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1977556175, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1977556175|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1977556175} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:09:48,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1727567125 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1727567125 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1727567125 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1727567125 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-1727567125| ~z$w_buff1_used~0_In-1727567125) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1727567125|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1727567125, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1727567125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1727567125, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1727567125} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1727567125, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1727567125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1727567125, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1727567125, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1727567125|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:09:48,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1213711951 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1213711951 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1213711951|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In1213711951 |P2Thread1of1ForFork0_#t~ite42_Out1213711951|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1213711951, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1213711951} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1213711951, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1213711951, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1213711951|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:09:48,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1497049732 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1497049732 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1497049732 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1497049732 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1497049732| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1497049732 |P2Thread1of1ForFork0_#t~ite43_Out-1497049732|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1497049732, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1497049732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1497049732, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1497049732} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1497049732|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1497049732, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1497049732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1497049732, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1497049732} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:09:48,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:09:48,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:09:48,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out1471297355| |ULTIMATE.start_main_#t~ite47_Out1471297355|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1471297355 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1471297355 256)))) (or (and .cse0 (= ~z~0_In1471297355 |ULTIMATE.start_main_#t~ite47_Out1471297355|) (or .cse1 .cse2)) (and .cse0 (= ~z$w_buff1~0_In1471297355 |ULTIMATE.start_main_#t~ite47_Out1471297355|) (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1471297355, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1471297355, ~z$w_buff1~0=~z$w_buff1~0_In1471297355, ~z~0=~z~0_In1471297355} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1471297355, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1471297355|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1471297355, ~z$w_buff1~0=~z$w_buff1~0_In1471297355, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1471297355|, ~z~0=~z~0_In1471297355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:09:48,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1920052973 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1920052973 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1920052973| ~z$w_buff0_used~0_In-1920052973)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1920052973| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1920052973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920052973} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1920052973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920052973, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1920052973|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:09:48,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1845412909 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1845412909 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1845412909 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1845412909 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1845412909| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1845412909 |ULTIMATE.start_main_#t~ite50_Out1845412909|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1845412909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1845412909, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1845412909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1845412909} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1845412909|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1845412909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1845412909, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1845412909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1845412909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:09:48,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1396420624 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1396420624 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1396420624| ~z$r_buff0_thd0~0_In-1396420624)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1396420624| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1396420624, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1396420624} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1396420624, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1396420624|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1396420624} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:09:48,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1301821235 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1301821235 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1301821235 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1301821235 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1301821235| ~z$r_buff1_thd0~0_In-1301821235) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1301821235| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1301821235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1301821235, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1301821235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1301821235} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1301821235|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1301821235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1301821235, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1301821235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1301821235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:09:48,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:09:48,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:09:48 BasicIcfg [2019-12-27 01:09:48,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:09:48,235 INFO L168 Benchmark]: Toolchain (without parser) took 98161.74 ms. Allocated memory was 137.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.4 MB in the beginning and 745.8 MB in the end (delta: -644.4 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 01:09:48,236 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:09:48,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.03 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 154.3 MB in the end (delta: -53.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:09:48,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.34 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:09:48,237 INFO L168 Benchmark]: Boogie Preprocessor took 47.15 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:09:48,238 INFO L168 Benchmark]: RCFGBuilder took 844.49 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 99.0 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:09:48,244 INFO L168 Benchmark]: TraceAbstraction took 96448.04 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.3 MB in the beginning and 745.8 MB in the end (delta: -647.5 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 01:09:48,246 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.47 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.03 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 154.3 MB in the end (delta: -53.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.34 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 151.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 47.15 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.49 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 99.0 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96448.04 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.3 MB in the beginning and 745.8 MB in the end (delta: -647.5 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t83, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t84, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t85, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.1s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7089 SDtfs, 7096 SDslu, 23609 SDs, 0 SdLazy, 10661 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 34 SyntacticMatches, 17 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 211120 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1340 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1243 ConstructedInterpolants, 0 QuantifiedInterpolants, 229487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...