/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:19:22,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:19:22,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:19:22,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:19:22,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:19:22,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:19:22,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:19:22,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:19:22,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:19:22,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:19:22,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:19:22,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:19:22,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:19:22,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:19:22,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:19:22,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:19:22,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:19:22,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:19:22,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:19:22,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:19:22,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:19:22,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:19:22,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:19:22,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:19:22,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:19:22,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:19:22,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:19:22,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:19:22,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:19:22,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:19:22,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:19:22,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:19:22,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:19:22,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:19:22,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:19:22,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:19:22,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:19:22,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:19:22,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:19:22,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:19:22,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:19:22,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:19:22,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:19:22,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:19:22,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:19:22,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:19:22,845 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:19:22,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:19:22,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:19:22,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:19:22,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:19:22,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:19:22,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:19:22,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:19:22,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:19:22,848 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:19:22,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:19:22,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:19:22,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:19:22,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:19:22,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:19:22,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:19:22,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:19:22,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:19:22,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:19:22,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:19:22,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:19:22,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:19:22,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:19:22,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:19:22,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:19:22,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:19:23,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:19:23,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:19:23,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:19:23,151 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:19:23,151 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:19:23,152 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2019-12-18 13:19:23,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f30dc77/00ff23beb07147dd853329a9a8ddde66/FLAG2d572d995 [2019-12-18 13:19:23,829 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:19:23,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2019-12-18 13:19:23,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f30dc77/00ff23beb07147dd853329a9a8ddde66/FLAG2d572d995 [2019-12-18 13:19:24,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f30dc77/00ff23beb07147dd853329a9a8ddde66 [2019-12-18 13:19:24,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:19:24,144 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:19:24,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:19:24,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:19:24,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:19:24,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:24,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ffe542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24, skipping insertion in model container [2019-12-18 13:19:24,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:24,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:19:24,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:19:24,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:19:24,779 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:19:24,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:19:24,923 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:19:24,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24 WrapperNode [2019-12-18 13:19:24,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:19:24,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:19:24,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:19:24,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:19:24,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:24,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:24,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:19:24,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:19:24,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:19:24,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:19:25,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:25,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:25,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:25,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:25,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:25,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:25,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... [2019-12-18 13:19:25,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:19:25,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:19:25,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:19:25,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:19:25,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:19:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:19:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:19:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:19:25,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:19:25,104 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:19:25,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:19:25,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:19:25,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:19:25,104 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:19:25,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:19:25,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:19:25,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:19:25,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:19:25,110 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:19:25,864 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:19:25,864 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:19:25,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:19:25 BoogieIcfgContainer [2019-12-18 13:19:25,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:19:25,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:19:25,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:19:25,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:19:25,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:19:24" (1/3) ... [2019-12-18 13:19:25,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a71ab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:19:25, skipping insertion in model container [2019-12-18 13:19:25,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:19:24" (2/3) ... [2019-12-18 13:19:25,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a71ab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:19:25, skipping insertion in model container [2019-12-18 13:19:25,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:19:25" (3/3) ... [2019-12-18 13:19:25,875 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.oepc.i [2019-12-18 13:19:25,886 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:19:25,887 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:19:25,895 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:19:25,896 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:19:25,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,992 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,993 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:25,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,020 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,022 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:19:26,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:19:26,069 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:19:26,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:19:26,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:19:26,070 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:19:26,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:19:26,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:19:26,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:19:26,070 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:19:26,087 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 13:19:26,088 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 13:19:26,201 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 13:19:26,201 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:19:26,227 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 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:19:26,257 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 13:19:26,351 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 13:19:26,351 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:19:26,362 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 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:19:26,386 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:19:26,388 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:19:31,580 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 13:19:31,733 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 13:19:31,928 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-18 13:19:31,928 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:19:31,932 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 13:19:50,516 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-18 13:19:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-18 13:19:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:19:50,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:50,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:19:50,525 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-18 13:19:50,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-18 13:19:50,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:50,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849971089] [2019-12-18 13:19:50,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:50,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849971089] [2019-12-18 13:19:50,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:50,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:19:50,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644299058] [2019-12-18 13:19:50,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:50,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:50,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:50,772 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-18 13:19:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:54,490 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-18 13:19:54,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:54,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:19:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:55,162 INFO L225 Difference]: With dead ends: 117122 [2019-12-18 13:19:55,162 INFO L226 Difference]: Without dead ends: 109842 [2019-12-18 13:19:55,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-18 13:20:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-18 13:20:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-18 13:20:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-18 13:20:03,224 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-18 13:20:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:03,224 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-18 13:20:03,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:20:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-18 13:20:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:20:03,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:03,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:06,669 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-18 13:20:06,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:06,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-18 13:20:06,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:06,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645253188] [2019-12-18 13:20:06,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:06,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645253188] [2019-12-18 13:20:06,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:06,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:20:06,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896493192] [2019-12-18 13:20:06,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:20:06,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:20:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:20:06,797 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-18 13:20:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:08,028 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-18 13:20:08,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:20:08,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:20:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:09,362 INFO L225 Difference]: With dead ends: 170700 [2019-12-18 13:20:09,362 INFO L226 Difference]: Without dead ends: 170651 [2019-12-18 13:20:09,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:20:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-18 13:20:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-18 13:20:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-18 13:20:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-18 13:20:23,633 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-18 13:20:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:23,634 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-18 13:20:23,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:20:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-18 13:20:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:20:23,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:23,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:23,642 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-18 13:20:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-18 13:20:23,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:23,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553892846] [2019-12-18 13:20:23,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:23,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553892846] [2019-12-18 13:20:23,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:23,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:20:23,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141537305] [2019-12-18 13:20:23,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:20:23,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:23,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:20:23,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:23,720 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-18 13:20:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:23,855 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-18 13:20:23,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:20:23,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:20:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:23,929 INFO L225 Difference]: With dead ends: 33806 [2019-12-18 13:20:23,929 INFO L226 Difference]: Without dead ends: 33806 [2019-12-18 13:20:23,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-18 13:20:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-18 13:20:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-18 13:20:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-18 13:20:24,696 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-18 13:20:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:24,696 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-18 13:20:24,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:20:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-18 13:20:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:20:24,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:24,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:24,701 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-18 13:20:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-18 13:20:24,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:24,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159607137] [2019-12-18 13:20:24,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:24,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159607137] [2019-12-18 13:20:24,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:24,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:20:24,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614128942] [2019-12-18 13:20:24,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:20:24,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:24,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:20:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:24,770 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-18 13:20:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:27,251 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-18 13:20:27,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:20:27,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:20:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:27,342 INFO L225 Difference]: With dead ends: 52205 [2019-12-18 13:20:27,342 INFO L226 Difference]: Without dead ends: 52205 [2019-12-18 13:20:27,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-18 13:20:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-18 13:20:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-18 13:20:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-18 13:20:28,179 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-18 13:20:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:28,180 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-18 13:20:28,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:20:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-18 13:20:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:20:28,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:28,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:28,185 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-18 13:20:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-18 13:20:28,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:28,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753048073] [2019-12-18 13:20:28,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:28,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753048073] [2019-12-18 13:20:28,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:28,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:20:28,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174095713] [2019-12-18 13:20:28,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:20:28,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:28,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:20:28,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:20:28,292 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-18 13:20:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:28,696 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-18 13:20:28,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:20:28,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:20:28,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:28,770 INFO L225 Difference]: With dead ends: 46485 [2019-12-18 13:20:28,770 INFO L226 Difference]: Without dead ends: 46485 [2019-12-18 13:20:28,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:20:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-18 13:20:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-18 13:20:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-18 13:20:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-18 13:20:29,896 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-18 13:20:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:29,897 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-18 13:20:29,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:20:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-18 13:20:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:20:29,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:29,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:29,901 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-18 13:20:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:29,901 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-18 13:20:29,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:29,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938467358] [2019-12-18 13:20:29,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:29,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938467358] [2019-12-18 13:20:29,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:29,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:20:29,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198434526] [2019-12-18 13:20:29,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:20:29,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:29,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:20:29,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:20:29,983 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-18 13:20:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:30,395 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-18 13:20:30,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:20:30,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:20:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:30,480 INFO L225 Difference]: With dead ends: 51005 [2019-12-18 13:20:30,481 INFO L226 Difference]: Without dead ends: 51005 [2019-12-18 13:20:30,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:20:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-18 13:20:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-18 13:20:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-18 13:20:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-18 13:20:31,262 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-18 13:20:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:31,262 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-18 13:20:31,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:20:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-18 13:20:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:20:31,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:31,272 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-18 13:20:31,273 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-18 13:20:31,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:31,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-18 13:20:31,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:31,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060280541] [2019-12-18 13:20:31,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:31,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060280541] [2019-12-18 13:20:31,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:31,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:20:31,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186681265] [2019-12-18 13:20:31,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:20:31,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:20:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:20:31,384 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-18 13:20:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:32,395 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-18 13:20:32,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:20:32,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:20:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:32,498 INFO L225 Difference]: With dead ends: 60565 [2019-12-18 13:20:32,498 INFO L226 Difference]: Without dead ends: 60558 [2019-12-18 13:20:32,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:20:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-18 13:20:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-18 13:20:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-18 13:20:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-18 13:20:33,361 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-18 13:20:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:33,361 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-18 13:20:33,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:20:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-18 13:20:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:20:33,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:33,371 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-18 13:20:33,371 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-18 13:20:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-18 13:20:33,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:33,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804037166] [2019-12-18 13:20:33,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:33,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804037166] [2019-12-18 13:20:33,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:33,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:20:33,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604864293] [2019-12-18 13:20:33,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:20:33,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:33,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:20:33,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:20:33,469 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-18 13:20:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:34,166 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-18 13:20:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:20:34,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:20:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:34,272 INFO L225 Difference]: With dead ends: 63360 [2019-12-18 13:20:34,272 INFO L226 Difference]: Without dead ends: 63353 [2019-12-18 13:20:34,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:20:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-18 13:20:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-18 13:20:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-18 13:20:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-18 13:20:35,469 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-18 13:20:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:35,470 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-18 13:20:35,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:20:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-18 13:20:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:20:35,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:35,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:35,483 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-18 13:20:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-18 13:20:35,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:35,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42733514] [2019-12-18 13:20:35,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:35,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42733514] [2019-12-18 13:20:35,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:35,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:20:35,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858022272] [2019-12-18 13:20:35,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:20:35,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:20:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:20:35,548 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-18 13:20:35,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:35,649 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-18 13:20:35,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:20:35,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:20:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:35,683 INFO L225 Difference]: With dead ends: 18121 [2019-12-18 13:20:35,683 INFO L226 Difference]: Without dead ends: 18121 [2019-12-18 13:20:35,684 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-18 13:20:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-18 13:20:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-18 13:20:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 13:20:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-18 13:20:35,953 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-18 13:20:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:35,954 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-18 13:20:35,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:20:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-18 13:20:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:20:35,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:35,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:35,968 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-18 13:20:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-18 13:20:35,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:35,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552636312] [2019-12-18 13:20:35,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:36,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552636312] [2019-12-18 13:20:36,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:36,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:20:36,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004799569] [2019-12-18 13:20:36,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:20:36,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:20:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:36,007 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-18 13:20:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:36,140 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-18 13:20:36,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:20:36,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:20:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:36,183 INFO L225 Difference]: With dead ends: 23499 [2019-12-18 13:20:36,183 INFO L226 Difference]: Without dead ends: 23499 [2019-12-18 13:20:36,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-18 13:20:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-18 13:20:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 13:20:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-18 13:20:36,519 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-18 13:20:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:36,519 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-18 13:20:36,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:20:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-18 13:20:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:20:36,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:36,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:36,532 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-18 13:20:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:36,532 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-18 13:20:36,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:36,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805255465] [2019-12-18 13:20:36,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:36,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805255465] [2019-12-18 13:20:36,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:36,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:20:36,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522924925] [2019-12-18 13:20:36,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:20:36,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:36,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:20:36,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:20:36,630 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-18 13:20:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:37,000 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-18 13:20:37,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:20:37,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:20:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:37,032 INFO L225 Difference]: With dead ends: 21964 [2019-12-18 13:20:37,032 INFO L226 Difference]: Without dead ends: 21964 [2019-12-18 13:20:37,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:20:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-18 13:20:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-18 13:20:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-18 13:20:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-18 13:20:37,503 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-18 13:20:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:37,503 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-18 13:20:37,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:20:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-18 13:20:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:20:37,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:37,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:37,519 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-18 13:20:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-18 13:20:37,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:37,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285624923] [2019-12-18 13:20:37,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:37,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285624923] [2019-12-18 13:20:37,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:37,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:20:37,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953080287] [2019-12-18 13:20:37,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:20:37,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:37,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:20:37,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:20:37,626 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-18 13:20:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:38,039 INFO L93 Difference]: Finished difference Result 24066 states and 70567 transitions. [2019-12-18 13:20:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:20:38,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 13:20:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:38,072 INFO L225 Difference]: With dead ends: 24066 [2019-12-18 13:20:38,073 INFO L226 Difference]: Without dead ends: 24066 [2019-12-18 13:20:38,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:20:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24066 states. [2019-12-18 13:20:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24066 to 20500. [2019-12-18 13:20:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20500 states. [2019-12-18 13:20:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20500 states to 20500 states and 60659 transitions. [2019-12-18 13:20:38,387 INFO L78 Accepts]: Start accepts. Automaton has 20500 states and 60659 transitions. Word has length 28 [2019-12-18 13:20:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:38,387 INFO L462 AbstractCegarLoop]: Abstraction has 20500 states and 60659 transitions. [2019-12-18 13:20:38,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:20:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 20500 states and 60659 transitions. [2019-12-18 13:20:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:20:38,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:38,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:38,408 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-18 13:20:38,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:38,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-18 13:20:38,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:38,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312661123] [2019-12-18 13:20:38,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:38,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312661123] [2019-12-18 13:20:38,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:38,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:20:38,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864998437] [2019-12-18 13:20:38,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:20:38,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:38,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:20:38,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:20:38,522 INFO L87 Difference]: Start difference. First operand 20500 states and 60659 transitions. Second operand 6 states. [2019-12-18 13:20:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:39,297 INFO L93 Difference]: Finished difference Result 27550 states and 80418 transitions. [2019-12-18 13:20:39,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:20:39,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 13:20:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:39,346 INFO L225 Difference]: With dead ends: 27550 [2019-12-18 13:20:39,346 INFO L226 Difference]: Without dead ends: 27550 [2019-12-18 13:20:39,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:20:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27550 states. [2019-12-18 13:20:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27550 to 21734. [2019-12-18 13:20:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-18 13:20:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64417 transitions. [2019-12-18 13:20:39,725 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64417 transitions. Word has length 33 [2019-12-18 13:20:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:39,725 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64417 transitions. [2019-12-18 13:20:39,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:20:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64417 transitions. [2019-12-18 13:20:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:20:39,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:39,745 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-18 13:20:39,745 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-18 13:20:39,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:39,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1108508854, now seen corresponding path program 1 times [2019-12-18 13:20:39,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:39,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356523293] [2019-12-18 13:20:39,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:39,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356523293] [2019-12-18 13:20:39,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:39,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:20:39,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120203792] [2019-12-18 13:20:39,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:20:39,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:20:39,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:20:39,843 INFO L87 Difference]: Start difference. First operand 21734 states and 64417 transitions. Second operand 6 states. [2019-12-18 13:20:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:40,607 INFO L93 Difference]: Finished difference Result 26719 states and 78128 transitions. [2019-12-18 13:20:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:20:40,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 13:20:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:40,644 INFO L225 Difference]: With dead ends: 26719 [2019-12-18 13:20:40,644 INFO L226 Difference]: Without dead ends: 26719 [2019-12-18 13:20:40,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:20:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26719 states. [2019-12-18 13:20:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26719 to 18663. [2019-12-18 13:20:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18663 states. [2019-12-18 13:20:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18663 states to 18663 states and 55458 transitions. [2019-12-18 13:20:40,967 INFO L78 Accepts]: Start accepts. Automaton has 18663 states and 55458 transitions. Word has length 34 [2019-12-18 13:20:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:40,967 INFO L462 AbstractCegarLoop]: Abstraction has 18663 states and 55458 transitions. [2019-12-18 13:20:40,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:20:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 18663 states and 55458 transitions. [2019-12-18 13:20:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:20:40,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:40,990 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-18 13:20:40,990 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-18 13:20:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-18 13:20:40,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:40,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927281625] [2019-12-18 13:20:40,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:41,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927281625] [2019-12-18 13:20:41,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:41,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:20:41,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714382952] [2019-12-18 13:20:41,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:20:41,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:41,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:20:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:41,127 INFO L87 Difference]: Start difference. First operand 18663 states and 55458 transitions. Second operand 3 states. [2019-12-18 13:20:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:41,208 INFO L93 Difference]: Finished difference Result 18662 states and 55456 transitions. [2019-12-18 13:20:41,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:20:41,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:20:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:41,242 INFO L225 Difference]: With dead ends: 18662 [2019-12-18 13:20:41,242 INFO L226 Difference]: Without dead ends: 18662 [2019-12-18 13:20:41,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18662 states. [2019-12-18 13:20:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18662 to 18662. [2019-12-18 13:20:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18662 states. [2019-12-18 13:20:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18662 states to 18662 states and 55456 transitions. [2019-12-18 13:20:41,611 INFO L78 Accepts]: Start accepts. Automaton has 18662 states and 55456 transitions. Word has length 39 [2019-12-18 13:20:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:41,611 INFO L462 AbstractCegarLoop]: Abstraction has 18662 states and 55456 transitions. [2019-12-18 13:20:41,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:20:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 18662 states and 55456 transitions. [2019-12-18 13:20:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:20:41,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:41,631 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-18 13:20:41,631 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-18 13:20:41,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-18 13:20:41,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:41,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498760698] [2019-12-18 13:20:41,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:41,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498760698] [2019-12-18 13:20:41,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:41,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:20:41,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876231519] [2019-12-18 13:20:41,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:20:41,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:41,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:20:41,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:20:41,700 INFO L87 Difference]: Start difference. First operand 18662 states and 55456 transitions. Second operand 5 states. [2019-12-18 13:20:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:42,387 INFO L93 Difference]: Finished difference Result 26886 states and 79089 transitions. [2019-12-18 13:20:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:20:42,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:20:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:42,439 INFO L225 Difference]: With dead ends: 26886 [2019-12-18 13:20:42,439 INFO L226 Difference]: Without dead ends: 26886 [2019-12-18 13:20:42,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:20:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26886 states. [2019-12-18 13:20:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26886 to 24800. [2019-12-18 13:20:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24800 states. [2019-12-18 13:20:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24800 states to 24800 states and 73424 transitions. [2019-12-18 13:20:42,843 INFO L78 Accepts]: Start accepts. Automaton has 24800 states and 73424 transitions. Word has length 40 [2019-12-18 13:20:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:42,843 INFO L462 AbstractCegarLoop]: Abstraction has 24800 states and 73424 transitions. [2019-12-18 13:20:42,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:20:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 24800 states and 73424 transitions. [2019-12-18 13:20:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:20:42,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:42,874 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-18 13:20:42,874 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-18 13:20:42,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash -554035702, now seen corresponding path program 2 times [2019-12-18 13:20:42,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:42,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458038534] [2019-12-18 13:20:42,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:42,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458038534] [2019-12-18 13:20:42,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:42,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:20:42,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567788669] [2019-12-18 13:20:42,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:20:42,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:42,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:20:42,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:42,972 INFO L87 Difference]: Start difference. First operand 24800 states and 73424 transitions. Second operand 3 states. [2019-12-18 13:20:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:43,063 INFO L93 Difference]: Finished difference Result 24800 states and 73346 transitions. [2019-12-18 13:20:43,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:20:43,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 13:20:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:43,096 INFO L225 Difference]: With dead ends: 24800 [2019-12-18 13:20:43,097 INFO L226 Difference]: Without dead ends: 24800 [2019-12-18 13:20:43,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24800 states. [2019-12-18 13:20:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24800 to 20604. [2019-12-18 13:20:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20604 states. [2019-12-18 13:20:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20604 states to 20604 states and 61757 transitions. [2019-12-18 13:20:43,427 INFO L78 Accepts]: Start accepts. Automaton has 20604 states and 61757 transitions. Word has length 40 [2019-12-18 13:20:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:43,428 INFO L462 AbstractCegarLoop]: Abstraction has 20604 states and 61757 transitions. [2019-12-18 13:20:43,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:20:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 20604 states and 61757 transitions. [2019-12-18 13:20:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:20:43,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:43,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:43,447 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-18 13:20:43,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash -559165763, now seen corresponding path program 1 times [2019-12-18 13:20:43,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:43,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86779495] [2019-12-18 13:20:43,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:43,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86779495] [2019-12-18 13:20:43,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:43,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:20:43,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018087542] [2019-12-18 13:20:43,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:20:43,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:20:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:20:43,502 INFO L87 Difference]: Start difference. First operand 20604 states and 61757 transitions. Second operand 5 states. [2019-12-18 13:20:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:43,603 INFO L93 Difference]: Finished difference Result 19387 states and 59138 transitions. [2019-12-18 13:20:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:20:43,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 13:20:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:43,632 INFO L225 Difference]: With dead ends: 19387 [2019-12-18 13:20:43,632 INFO L226 Difference]: Without dead ends: 19387 [2019-12-18 13:20:43,632 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-18 13:20:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19387 states. [2019-12-18 13:20:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19387 to 19387. [2019-12-18 13:20:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19387 states. [2019-12-18 13:20:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19387 states to 19387 states and 59138 transitions. [2019-12-18 13:20:43,924 INFO L78 Accepts]: Start accepts. Automaton has 19387 states and 59138 transitions. Word has length 41 [2019-12-18 13:20:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:43,924 INFO L462 AbstractCegarLoop]: Abstraction has 19387 states and 59138 transitions. [2019-12-18 13:20:43,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:20:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19387 states and 59138 transitions. [2019-12-18 13:20:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:20:43,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:43,944 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-18 13:20:43,944 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-18 13:20:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:43,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1104102808, now seen corresponding path program 1 times [2019-12-18 13:20:43,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:43,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536462129] [2019-12-18 13:20:43,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:44,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536462129] [2019-12-18 13:20:44,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:44,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:20:44,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245245294] [2019-12-18 13:20:44,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:20:44,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:44,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:20:44,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:20:44,064 INFO L87 Difference]: Start difference. First operand 19387 states and 59138 transitions. Second operand 7 states. [2019-12-18 13:20:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:44,866 INFO L93 Difference]: Finished difference Result 54000 states and 163522 transitions. [2019-12-18 13:20:44,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:20:44,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:20:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:44,946 INFO L225 Difference]: With dead ends: 54000 [2019-12-18 13:20:44,946 INFO L226 Difference]: Without dead ends: 41917 [2019-12-18 13:20:44,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:20:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41917 states. [2019-12-18 13:20:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41917 to 22809. [2019-12-18 13:20:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22809 states. [2019-12-18 13:20:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22809 states to 22809 states and 69555 transitions. [2019-12-18 13:20:45,466 INFO L78 Accepts]: Start accepts. Automaton has 22809 states and 69555 transitions. Word has length 65 [2019-12-18 13:20:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:45,466 INFO L462 AbstractCegarLoop]: Abstraction has 22809 states and 69555 transitions. [2019-12-18 13:20:45,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:20:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 22809 states and 69555 transitions. [2019-12-18 13:20:45,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:20:45,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:45,489 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-18 13:20:45,489 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-18 13:20:45,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:45,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1989977016, now seen corresponding path program 2 times [2019-12-18 13:20:45,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:45,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569266185] [2019-12-18 13:20:45,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:45,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569266185] [2019-12-18 13:20:45,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:45,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:20:45,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114758899] [2019-12-18 13:20:45,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:20:45,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:45,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:20:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:20:45,592 INFO L87 Difference]: Start difference. First operand 22809 states and 69555 transitions. Second operand 7 states. [2019-12-18 13:20:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:46,424 INFO L93 Difference]: Finished difference Result 60092 states and 179785 transitions. [2019-12-18 13:20:46,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:20:46,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:20:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:46,534 INFO L225 Difference]: With dead ends: 60092 [2019-12-18 13:20:46,534 INFO L226 Difference]: Without dead ends: 43239 [2019-12-18 13:20:46,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:20:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43239 states. [2019-12-18 13:20:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43239 to 26856. [2019-12-18 13:20:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26856 states. [2019-12-18 13:20:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26856 states to 26856 states and 80952 transitions. [2019-12-18 13:20:47,257 INFO L78 Accepts]: Start accepts. Automaton has 26856 states and 80952 transitions. Word has length 65 [2019-12-18 13:20:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:47,257 INFO L462 AbstractCegarLoop]: Abstraction has 26856 states and 80952 transitions. [2019-12-18 13:20:47,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:20:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 26856 states and 80952 transitions. [2019-12-18 13:20:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:20:47,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:47,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:47,286 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-18 13:20:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash 982875086, now seen corresponding path program 3 times [2019-12-18 13:20:47,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:47,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881310386] [2019-12-18 13:20:47,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:47,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-18 13:20:47,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881310386] [2019-12-18 13:20:47,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:47,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:20:47,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666721997] [2019-12-18 13:20:47,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:20:47,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:47,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:20:47,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:20:47,362 INFO L87 Difference]: Start difference. First operand 26856 states and 80952 transitions. Second operand 7 states. [2019-12-18 13:20:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:47,964 INFO L93 Difference]: Finished difference Result 52328 states and 156053 transitions. [2019-12-18 13:20:47,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:20:47,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:20:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:48,051 INFO L225 Difference]: With dead ends: 52328 [2019-12-18 13:20:48,052 INFO L226 Difference]: Without dead ends: 45948 [2019-12-18 13:20:48,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:20:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45948 states. [2019-12-18 13:20:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45948 to 27164. [2019-12-18 13:20:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27164 states. [2019-12-18 13:20:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27164 states to 27164 states and 81903 transitions. [2019-12-18 13:20:48,843 INFO L78 Accepts]: Start accepts. Automaton has 27164 states and 81903 transitions. Word has length 65 [2019-12-18 13:20:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:48,843 INFO L462 AbstractCegarLoop]: Abstraction has 27164 states and 81903 transitions. [2019-12-18 13:20:48,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:20:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 27164 states and 81903 transitions. [2019-12-18 13:20:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:20:48,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:48,884 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-18 13:20:48,884 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-18 13:20:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash -156874998, now seen corresponding path program 4 times [2019-12-18 13:20:48,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:48,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272188326] [2019-12-18 13:20:48,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:48,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272188326] [2019-12-18 13:20:48,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:48,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:20:48,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707988423] [2019-12-18 13:20:48,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:20:48,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:48,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:20:48,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:48,946 INFO L87 Difference]: Start difference. First operand 27164 states and 81903 transitions. Second operand 3 states. [2019-12-18 13:20:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:49,174 INFO L93 Difference]: Finished difference Result 30812 states and 93241 transitions. [2019-12-18 13:20:49,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:20:49,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:20:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:49,248 INFO L225 Difference]: With dead ends: 30812 [2019-12-18 13:20:49,248 INFO L226 Difference]: Without dead ends: 30812 [2019-12-18 13:20:49,254 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-18 13:20:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30812 states. [2019-12-18 13:20:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30812 to 24945. [2019-12-18 13:20:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24945 states. [2019-12-18 13:20:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24945 states to 24945 states and 76253 transitions. [2019-12-18 13:20:49,738 INFO L78 Accepts]: Start accepts. Automaton has 24945 states and 76253 transitions. Word has length 65 [2019-12-18 13:20:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:49,738 INFO L462 AbstractCegarLoop]: Abstraction has 24945 states and 76253 transitions. [2019-12-18 13:20:49,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:20:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 24945 states and 76253 transitions. [2019-12-18 13:20:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:20:49,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:49,764 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-18 13:20:49,764 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-18 13:20:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:49,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1879963745, now seen corresponding path program 1 times [2019-12-18 13:20:49,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:49,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432736008] [2019-12-18 13:20:49,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:49,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432736008] [2019-12-18 13:20:49,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:49,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:20:49,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838223544] [2019-12-18 13:20:49,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:20:49,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:49,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:20:49,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:20:49,840 INFO L87 Difference]: Start difference. First operand 24945 states and 76253 transitions. Second operand 7 states. [2019-12-18 13:20:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:50,469 INFO L93 Difference]: Finished difference Result 51485 states and 156400 transitions. [2019-12-18 13:20:50,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:20:50,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 13:20:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:50,560 INFO L225 Difference]: With dead ends: 51485 [2019-12-18 13:20:50,560 INFO L226 Difference]: Without dead ends: 47098 [2019-12-18 13:20:50,561 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-18 13:20:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47098 states. [2019-12-18 13:20:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47098 to 25215. [2019-12-18 13:20:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25215 states. [2019-12-18 13:20:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25215 states to 25215 states and 77212 transitions. [2019-12-18 13:20:51,144 INFO L78 Accepts]: Start accepts. Automaton has 25215 states and 77212 transitions. Word has length 66 [2019-12-18 13:20:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:51,144 INFO L462 AbstractCegarLoop]: Abstraction has 25215 states and 77212 transitions. [2019-12-18 13:20:51,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:20:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 25215 states and 77212 transitions. [2019-12-18 13:20:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:20:51,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:51,172 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-18 13:20:51,172 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-18 13:20:51,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:51,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2128783339, now seen corresponding path program 2 times [2019-12-18 13:20:51,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:51,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290513474] [2019-12-18 13:20:51,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:51,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290513474] [2019-12-18 13:20:51,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:51,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:20:51,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689481804] [2019-12-18 13:20:51,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:20:51,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:51,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:20:51,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:20:51,245 INFO L87 Difference]: Start difference. First operand 25215 states and 77212 transitions. Second operand 4 states. [2019-12-18 13:20:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:51,408 INFO L93 Difference]: Finished difference Result 24999 states and 76324 transitions. [2019-12-18 13:20:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:20:51,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 13:20:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:51,444 INFO L225 Difference]: With dead ends: 24999 [2019-12-18 13:20:51,445 INFO L226 Difference]: Without dead ends: 24999 [2019-12-18 13:20:51,445 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-18 13:20:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24999 states. [2019-12-18 13:20:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24999 to 22340. [2019-12-18 13:20:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22340 states. [2019-12-18 13:20:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22340 states to 22340 states and 68504 transitions. [2019-12-18 13:20:51,946 INFO L78 Accepts]: Start accepts. Automaton has 22340 states and 68504 transitions. Word has length 66 [2019-12-18 13:20:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:51,946 INFO L462 AbstractCegarLoop]: Abstraction has 22340 states and 68504 transitions. [2019-12-18 13:20:51,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:20:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 22340 states and 68504 transitions. [2019-12-18 13:20:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:20:51,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:51,971 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-18 13:20:51,971 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-18 13:20:51,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:51,971 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-18 13:20:51,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:51,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009672340] [2019-12-18 13:20:51,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:52,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009672340] [2019-12-18 13:20:52,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:52,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:20:52,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351966272] [2019-12-18 13:20:52,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:20:52,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:52,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:20:52,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:52,031 INFO L87 Difference]: Start difference. First operand 22340 states and 68504 transitions. Second operand 3 states. [2019-12-18 13:20:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:52,118 INFO L93 Difference]: Finished difference Result 18693 states and 56125 transitions. [2019-12-18 13:20:52,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:20:52,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:20:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:52,151 INFO L225 Difference]: With dead ends: 18693 [2019-12-18 13:20:52,152 INFO L226 Difference]: Without dead ends: 18693 [2019-12-18 13:20:52,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:20:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18693 states. [2019-12-18 13:20:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18693 to 16335. [2019-12-18 13:20:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16335 states. [2019-12-18 13:20:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16335 states to 16335 states and 49065 transitions. [2019-12-18 13:20:52,457 INFO L78 Accepts]: Start accepts. Automaton has 16335 states and 49065 transitions. Word has length 66 [2019-12-18 13:20:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:52,457 INFO L462 AbstractCegarLoop]: Abstraction has 16335 states and 49065 transitions. [2019-12-18 13:20:52,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:20:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 16335 states and 49065 transitions. [2019-12-18 13:20:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:20:52,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:52,475 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-18 13:20:52,475 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-18 13:20:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-18 13:20:52,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:52,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554379073] [2019-12-18 13:20:52,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:52,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554379073] [2019-12-18 13:20:52,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:52,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:20:52,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334097242] [2019-12-18 13:20:52,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:20:52,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:52,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:20:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:20:52,660 INFO L87 Difference]: Start difference. First operand 16335 states and 49065 transitions. Second operand 11 states. [2019-12-18 13:20:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:53,998 INFO L93 Difference]: Finished difference Result 36261 states and 107501 transitions. [2019-12-18 13:20:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 13:20:53,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:20:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:54,058 INFO L225 Difference]: With dead ends: 36261 [2019-12-18 13:20:54,058 INFO L226 Difference]: Without dead ends: 27379 [2019-12-18 13:20:54,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 13:20:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27379 states. [2019-12-18 13:20:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27379 to 15754. [2019-12-18 13:20:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15754 states. [2019-12-18 13:20:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15754 states to 15754 states and 46992 transitions. [2019-12-18 13:20:54,460 INFO L78 Accepts]: Start accepts. Automaton has 15754 states and 46992 transitions. Word has length 67 [2019-12-18 13:20:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:54,460 INFO L462 AbstractCegarLoop]: Abstraction has 15754 states and 46992 transitions. [2019-12-18 13:20:54,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:20:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 15754 states and 46992 transitions. [2019-12-18 13:20:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:20:54,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:54,476 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-18 13:20:54,476 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-18 13:20:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-18 13:20:54,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:54,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72416965] [2019-12-18 13:20:54,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:20:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:20:54,587 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:20:54,588 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:20:54,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30|) |v_ULTIMATE.start_main_~#t931~0.offset_22| 0)) |v_#memory_int_19|) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t931~0.base_30|) (= 0 v_~a$w_buff1_used~0_450) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30| 1)) (= 0 |v_ULTIMATE.start_main_~#t931~0.offset_22|) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t931~0.base_30| 4)) (= v_~a$mem_tmp~0_16 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30|) 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= 0 v_~x~0_153) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_23|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ULTIMATE.start_main_~#t931~0.offset=|v_ULTIMATE.start_main_~#t931~0.offset_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ULTIMATE.start_main_~#t931~0.base=|v_ULTIMATE.start_main_~#t931~0.base_30|, ~x~0=v_~x~0_153, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_17|, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_13|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t932~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t931~0.offset, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t931~0.base, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t933~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t932~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t933~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:20:54,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~a$r_buff0_thd1~0_In468017514 ~a$r_buff1_thd1~0_Out468017514) (= ~a$r_buff1_thd3~0_Out468017514 ~a$r_buff0_thd3~0_In468017514) (= ~x~0_In468017514 ~__unbuffered_p0_EAX~0_Out468017514) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In468017514)) (= 1 ~a$r_buff0_thd1~0_Out468017514) (= ~a$r_buff0_thd0~0_In468017514 ~a$r_buff1_thd0~0_Out468017514) (= ~a$r_buff0_thd2~0_In468017514 ~a$r_buff1_thd2~0_Out468017514)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In468017514, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In468017514, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In468017514, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In468017514, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In468017514, ~x~0=~x~0_In468017514} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out468017514, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out468017514, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out468017514, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out468017514, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In468017514, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out468017514, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In468017514, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In468017514, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out468017514, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In468017514, ~x~0=~x~0_In468017514} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:20:54,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11|) |v_ULTIMATE.start_main_~#t932~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t932~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t932~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t932~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t932~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t932~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t932~0.offset, #length] because there is no mapped edge [2019-12-18 13:20:54,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t933~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11|) |v_ULTIMATE.start_main_~#t933~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t933~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t933~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t933~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_11|, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t933~0.base, ULTIMATE.start_main_~#t933~0.offset, #length] because there is no mapped edge [2019-12-18 13:20:54,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In269642891 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In269642891 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out269642891| ~a~0_In269642891) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out269642891| ~a$w_buff1~0_In269642891) (not .cse0)))) InVars {~a~0=~a~0_In269642891, ~a$w_buff1~0=~a$w_buff1~0_In269642891, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In269642891, ~a$w_buff1_used~0=~a$w_buff1_used~0_In269642891} OutVars{~a~0=~a~0_In269642891, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out269642891|, ~a$w_buff1~0=~a$w_buff1~0_In269642891, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In269642891, ~a$w_buff1_used~0=~a$w_buff1_used~0_In269642891} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 13:20:54,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_30| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_30|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_29|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_43|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:20:54,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1922931583 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1922931583 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1922931583| ~a$w_buff0_used~0_In1922931583)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1922931583| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1922931583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1922931583} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1922931583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1922931583, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1922931583|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:20:54,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1801566204 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1801566204 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1801566204 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1801566204 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1801566204| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1801566204| ~a$w_buff1_used~0_In-1801566204)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1801566204, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1801566204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1801566204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1801566204} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1801566204, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1801566204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1801566204, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1801566204|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1801566204} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:20:54,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1787161380 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1787161380 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1787161380| ~a$r_buff0_thd2~0_In1787161380)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1787161380| 0) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1787161380, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1787161380} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1787161380, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1787161380, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1787161380|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:20:54,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1731254031 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1731254031 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1731254031 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1731254031 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1731254031| ~a$r_buff1_thd2~0_In-1731254031) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1731254031|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1731254031, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1731254031, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1731254031, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1731254031} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1731254031, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1731254031, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1731254031, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1731254031, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1731254031|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:20:54,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:20:54,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-10461792 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-10461792 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-10461792| 0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-10461792| ~a$w_buff0_used~0_In-10461792) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-10461792, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-10461792} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-10461792|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-10461792, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-10461792} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:20:54,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1443191418 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1443191418 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1443191418 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1443191418 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1443191418|)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1443191418| ~a$w_buff1_used~0_In-1443191418) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1443191418, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1443191418, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1443191418, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1443191418} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1443191418|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1443191418, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1443191418, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1443191418, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1443191418} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:20:54,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In526542018 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In526542018 256)))) (or (and (= ~a$r_buff0_thd1~0_Out526542018 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out526542018 ~a$r_buff0_thd1~0_In526542018)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In526542018, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In526542018} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out526542018|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In526542018, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out526542018} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:20:54,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In898599548 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In898599548 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In898599548 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In898599548 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out898599548|)) (and (or .cse3 .cse2) (= ~a$r_buff1_thd1~0_In898599548 |P0Thread1of1ForFork1_#t~ite8_Out898599548|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In898599548, ~a$w_buff0_used~0=~a$w_buff0_used~0_In898599548, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In898599548, ~a$w_buff1_used~0=~a$w_buff1_used~0_In898599548} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out898599548|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In898599548, ~a$w_buff0_used~0=~a$w_buff0_used~0_In898599548, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In898599548, ~a$w_buff1_used~0=~a$w_buff1_used~0_In898599548} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:20:54,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_37|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:20:54,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1144330290 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out1144330290| ~a$w_buff1_used~0_In1144330290) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1144330290 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In1144330290 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1144330290 256))) (and (= 0 (mod ~a$w_buff1_used~0_In1144330290 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite30_Out1144330290| |P2Thread1of1ForFork0_#t~ite29_Out1144330290|)) (and (= |P2Thread1of1ForFork0_#t~ite30_Out1144330290| ~a$w_buff1_used~0_In1144330290) (= |P2Thread1of1ForFork0_#t~ite29_In1144330290| |P2Thread1of1ForFork0_#t~ite29_Out1144330290|) (not .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1144330290, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1144330290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1144330290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1144330290, ~weak$$choice2~0=~weak$$choice2~0_In1144330290, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1144330290|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1144330290, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1144330290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1144330290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1144330290, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1144330290|, ~weak$$choice2~0=~weak$$choice2~0_In1144330290, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1144330290|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 13:20:54,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~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|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:20:54,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 13:20:54,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In463455882 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In463455882 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out463455882| ~a~0_In463455882)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out463455882| ~a$w_buff1~0_In463455882) (not .cse1)))) InVars {~a~0=~a~0_In463455882, ~a$w_buff1~0=~a$w_buff1~0_In463455882, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In463455882, ~a$w_buff1_used~0=~a$w_buff1_used~0_In463455882} OutVars{~a~0=~a~0_In463455882, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out463455882|, ~a$w_buff1~0=~a$w_buff1~0_In463455882, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In463455882, ~a$w_buff1_used~0=~a$w_buff1_used~0_In463455882} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:20:54,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:20:54,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In190831575 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In190831575 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out190831575| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out190831575| ~a$w_buff0_used~0_In190831575)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In190831575, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In190831575} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out190831575|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In190831575, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In190831575} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:20:54,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-978452331 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-978452331 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-978452331 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-978452331 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-978452331| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-978452331| ~a$w_buff1_used~0_In-978452331) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-978452331, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-978452331, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-978452331, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-978452331} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-978452331, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-978452331, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-978452331, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-978452331, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-978452331|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:20:54,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1347642475 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1347642475 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1347642475|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1347642475| ~a$r_buff0_thd3~0_In1347642475)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1347642475, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1347642475} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1347642475, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1347642475, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1347642475|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:20:54,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-606770889 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-606770889 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-606770889 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-606770889 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-606770889|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In-606770889 |P2Thread1of1ForFork0_#t~ite43_Out-606770889|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-606770889, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-606770889, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-606770889, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-606770889} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-606770889|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-606770889, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-606770889, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-606770889, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-606770889} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:20:54,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:20:54,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] 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-18 13:20:54,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In1448203164 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1448203164 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1448203164| |ULTIMATE.start_main_#t~ite48_Out1448203164|))) (or (and (not .cse0) (= ~a$w_buff1~0_In1448203164 |ULTIMATE.start_main_#t~ite47_Out1448203164|) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite47_Out1448203164| ~a~0_In1448203164) (or .cse0 .cse1) .cse2))) InVars {~a~0=~a~0_In1448203164, ~a$w_buff1~0=~a$w_buff1~0_In1448203164, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1448203164, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1448203164} OutVars{~a~0=~a~0_In1448203164, ~a$w_buff1~0=~a$w_buff1~0_In1448203164, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1448203164|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1448203164, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1448203164|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1448203164} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:20:54,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1478670153 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1478670153 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1478670153| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out1478670153| ~a$w_buff0_used~0_In1478670153) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1478670153, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1478670153} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1478670153, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1478670153|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1478670153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:20:54,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1683184130 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-1683184130 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1683184130 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1683184130 256)))) (or (and (= ~a$w_buff1_used~0_In-1683184130 |ULTIMATE.start_main_#t~ite50_Out-1683184130|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1683184130|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1683184130, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683184130, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1683184130, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1683184130} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1683184130|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1683184130, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683184130, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1683184130, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1683184130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:20:54,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1255367125 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1255367125 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1255367125|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In-1255367125 |ULTIMATE.start_main_#t~ite51_Out-1255367125|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1255367125, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1255367125} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1255367125|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1255367125, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1255367125} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:20:54,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In871491620 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In871491620 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In871491620 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In871491620 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out871491620| ~a$r_buff1_thd0~0_In871491620)) (and (= |ULTIMATE.start_main_#t~ite52_Out871491620| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In871491620, ~a$w_buff0_used~0=~a$w_buff0_used~0_In871491620, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In871491620, ~a$w_buff1_used~0=~a$w_buff1_used~0_In871491620} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out871491620|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In871491620, ~a$w_buff0_used~0=~a$w_buff0_used~0_In871491620, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In871491620, ~a$w_buff1_used~0=~a$w_buff1_used~0_In871491620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:20:54,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~main$tmp_guard1~0_17 0) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= 0 v_~__unbuffered_p0_EAX~0_128)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:20:54,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:20:54 BasicIcfg [2019-12-18 13:20:54,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:20:54,747 INFO L168 Benchmark]: Toolchain (without parser) took 90604.02 ms. Allocated memory was 146.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 102.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 13:20:54,748 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:20:54,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.37 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 157.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:20:54,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.50 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:20:54,750 INFO L168 Benchmark]: Boogie Preprocessor took 42.46 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:20:54,750 INFO L168 Benchmark]: RCFGBuilder took 832.15 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:20:54,751 INFO L168 Benchmark]: TraceAbstraction took 88878.38 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 13:20:54,754 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.54 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.37 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 157.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.50 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.46 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.15 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88878.38 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 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(&t931, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t932, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t933, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.5s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5650 SDtfs, 5121 SDslu, 15097 SDs, 0 SdLazy, 5356 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 39 SyntacticMatches, 15 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred 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.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 203791 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1045 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 952 ConstructedInterpolants, 0 QuantifiedInterpolants, 156972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...